  
|
Program
Saturday, 16 July 2011
Sunday, 17 July 2011
| 8:45 |
Welcome - Peter Revesz |
| 9:00 |
Keynote Address
| Life: play and win in 20 trillion moves |
| Stuart Russell |
| How can we design systems that can achieve reasonable decision quality
over long time scales? One approach is based on temporal abstraction,
allowing deliberation over action choices of long duration. The talk
will explore this idea first in the classical planning context, where
the longstanding open problem of "downward refinement" is resolved.
In the context of hierarchical reinforcment learning, the idea of
partial programming provides a powerful and flexible method of
specifying constraints on behavior, leaving unspecified those choices
that the agent must learn to make on its own. Many avenues remain for
further development of these ideas. |
|
| 10:00 | Break |
| 10:30 |
Session 1 - Discrete Event Systems
| The Markov Reformulation Theorem |
| Michael Kassoff and Michael Genesereth |
| Automatic Synthesis of Temporal Invariants |
| Sara Bernardini and David E. Smith |
| Reformulation for the Diagnosis of Discrete-Event Systems |
| Alban Grastien and Gianluca Torta |
| A Theory of Abstraction for Diagnosis of Discrete-Event Systems |
| Grastien Alban and Gianluca Torta |
|
| 12:00 | Break |
| 13:30 | Lunch |
| 14:30 |
Session 2 - Planning
| Planning with State Uncertainty via Contingency Planning and Execution Monitoring |
| Minlue Wang and Richard Dearden |
Satisfiability Modulo Theories: an Efficient Approach
for the Resource-Constrained Project Scheduling Problem |
| Carlos Ansotegui, Miquel Bofill, Miquel Palahi, Josep Suy, and Mateu Villaret |
| Does Representation Matter in the Planning Competition? |
| Patricia Riddle, Robert C Holte, and Michael W Barley |
|
| 14:30 | Break |
| 16:00 |
Session 3 - Space-Time
| Spatiotemporal Interpolation Methods for Air Pollution Exposure |
| Lixin Li, Xingyou Zhang, James Holt, Jie Tian, and Reinhard Piltner |
| Path Symmetries in Undirected Uniform-Cost Grids |
| Daniel Harabor, Adi Botea, and Philip Kilby |
| Extracting Topological Information from Spatial Constraint Databases |
| Shasha Wu and Peter Revesz |
|
| 17:00 | Break |
| 20:30 | Dinner |
Monday, 18 July 2011
| 9:00 |
Session 4 - Constraint Satisfaction Problems
| Reformulating Dynamic Linear Constraint Satisfaction Problems as Weighted CSPs for Searching Robust Solutions |
| Laura Climent, Miguel Angel Salido, and Federico Barber |
| Reformulating R(*, m)C with Tree Decomposition |
| Shant Karakashian, Robert Woodward, and Berthe Choueiry |
| Reformulating the Dual Graphs of CSPs to Improve the Performance of Relational Neighborhood Inverse Consistency |
| Robert J. Woodward, Shant Karakashian, Berthe Choueiry, and Christian Bessiere |
| A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the SET Game |
| Amanda Swearngin, Berthe Choueiry, and Eugene Freuder |
|
| 10:30 | Break |
| 11:00 |
Panel - Abstraction, Reformulation, and Approximation
- Panelist: Rob Holte
- Panelist: Prasenjit Mitra
- Panelist: Peter Revesz
- Panelist: Henry Soldano
-
- Moderator: Michael Genesereth
-
- Questions to be addressed: Is there a common theory of ARA that bridges application areas (Reasoning, CSPs, Databases, Planning, Learning, and so forth). Is it possible / desirable to devise an ARA calculus (akin to resolution in logical reasoning)? What are the relative advantages and disadvantages of having a community focussed on ARA as well as / as opposed to presenting ARA ideas within other communities (such as CSPs)?
|
| 12:00 | Break |
| 13:30 | Lunch |
| 14:30 |
Session 5 - Machine Learning
| A modal view on abstract learning and reasoning |
| Henry Soldano |
| Simultaneous Abstract and Concrete Reinforcement Learning |
| Tiago Matos, Yannick Bergamo, Valdinei Silva, Fabio Cozman, and Anna Costa |
|
| 15:30 | Break |
| 16:00 |
Session 6 - Applications
| Classifying Scientific Publications Using Abstract Features |
| Cornelia Caragea, Adrian Silvescu, Saurabh Kataria, Doina Caragea, and Prasenjit Mitra |
| Efficient Pseudo-Boolean Satisfiability Encodings for Routing and Wavelength Assignment in Optical Networks |
| Miroslav Velev and Ping Gao |
| Modular Schemes for Constructing Equivalent Boolean Encodings of Cardinality Constraints and Application to Error Diagnosis in Formal Verification of Pipelined Microprocessors |
| Miroslav Velev and Ping Gao |
| Approximate Search on Protein Structures for Identification of Horizontal Gene Transfer in Bacteria |
| Swetha Billa, Mark Griep, and Peter Revesz |
|
|
|