| Invited Talks (Abstracts) | |
| State Abstraction in Real-Time Heuristic Search | p. 1 |
| Abstraction and Reformulation in the Generation of Constraint Models | p. 2 |
| A Framework for Integrating Optimization and Constraint Programming | p. 4 |
| Research Papers | |
| DFS-Tree Based Heuristic Search | p. 5 |
| Partial Pattern Databases | p. 20 |
| CDB-PV: A Constraint Database-Based Program Verifier | p. 35 |
| Generating Implied Boolean Constraints Via Singleton Consistency | p. 50 |
| Reformulating Constraint Satisfaction Problems to Improve Scalability | p. 64 |
| Reformulating Global Constraints: The Slide and Regular Constraints | p. 80 |
| Relaxation of Qualitative Constraint Networks | p. 93 |
| Dynamic Domain Abstraction Through Meta-diagnosis | p. 109 |
| Channeling Abstraction | p. 124 |
| Approximate Model-Based Diagnosis Using Greedy Stochastic Search | p. 139 |
| Combining Perimeter Search and Pattern Database Abstractions | p. 155 |
| Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic | p. 169 |
| Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion | p. 184 |
| A Meta-CSP Model for Optimal Planning | p. 200 |
| Reformulation for Extensional Reasoning | p. 215 |
| An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus | p. 230 |
| Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning | p. 243 |
| Model-Based Exploration in Continuous State Spaces | p. 258 |
| Active Learning of Dynamic Bayesian Networks in Markov Decision Processes | p. 273 |
| Boosting MUS Extraction | p. 285 |
| Homogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage | p. 300 |
| Formalizing the Abstraction Process in Model-Based Diagnosis | p. 314 |
| Boolean Approximation Revisited | p. 329 |
| An Analysis of Map-Based Abstraction and Refinement | p. 344 |
| Solving Difficult SAT Instances Using Greedy Clique Decomposition | p. 359 |
| Abstraction and Complexity Measures | p. 375 |
| Research Summaries | |
| Abstraction, Emergence, and Thought | p. 391 |
| What's Your Problem? The Problem of Problem Definition | p. 393 |
| A Reformulation-Based Approach to Explanation in Constraint Satisfaction | p. 395 |
| Integration of Constraint Programming and Metaheuristics | p. 397 |
| Rule-Based Reasoning Via Abstraction | p. 399 |
| Extensional Reasoning | p. 400 |
| Reformulating Constraint Models Using Input Data | p. 402 |
| Using Analogy Discovery to Create Abstractions | p. 405 |
| Distributed CSPs: Why It Is Assumed a Variable per Agent? | p. 407 |
| Decomposition of Games for Efficient Reasoning | p. 409 |
| Generalized Constraint Acquisition | p. 411 |
| Using Infeasibility to Improve Abstraction-Based Heuristics | p. 413 |
| Leveraging Graph Locality Via Abstraction | p. 415 |
| Author Index | p. 417 |
| Table of Contents provided by Ingram. All Rights Reserved. |