Vadim Bulitko (auth.), Ian Miguel, Wheeler Ruml (eds.)3540735798, 9783540735793
That’s why this book, which constitutes the refereed proceedings of the 7th International Symposium on Abstraction, Reformulation, and Approximation, held in Whistler, Canada, in July 2007, will undoubtedly prove so popular among researchers and professionals in relevant fields.
With 26 revised full papers presented, together with the abstracts of 3 invited papers and 13 research summaries, there is more than enough material here for even the most hardened expert to digest.
All current aspects of abstraction, reformulation, and approximation in the context of human common-sense reasoning, problem solving, and efficiently reasoning in complex domains are addressed.
Among the application fields of these techniques are automated reasoning, automatic programming, cognitive modeling, constraint programming, design, diagnosis, machine learning, model-based reasoning, planning, reasoning, scheduling, search, theorem proving, and tutoring.
Table of contents :
Front Matter….Pages –
State Abstraction in Real-Time Heuristic Search….Pages 1-1
Abstraction and Reformulation in the Generation of Constraint Models….Pages 2-3
A Framework for Integrating Optimization and Constraint Programming….Pages 4-4
DFS-Tree Based Heuristic Search….Pages 5-19
Partial Pattern Databases….Pages 20-34
CDB-PV: A Constraint Database-Based Program Verifier….Pages 35-49
Generating Implied Boolean Constraints Via Singleton Consistency….Pages 50-63
Reformulating Constraint Satisfaction Problems to Improve Scalability….Pages 64-79
Reformulating Global Constraints: The Slide and Regular Constraints….Pages 80-92
Relaxation of Qualitative Constraint Networks….Pages 93-108
Dynamic Domain Abstraction Through Meta-diagnosis….Pages 109-123
Channeling Abstraction….Pages 124-138
Approximate Model-Based Diagnosis Using Greedy Stochastic Search….Pages 139-154
Combining Perimeter Search and Pattern Database Abstractions….Pages 155-168
Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic….Pages 169-183
Tailoring Solver-Independent Constraint Models: A Case Study with Essence ′ and Minion ….Pages 184-199
A Meta-CSP Model for Optimal Planning….Pages 200-214
Reformulation for Extensional Reasoning….Pages 215-229
An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus….Pages 230-242
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning….Pages 243-257
Model-Based Exploration in Continuous State Spaces….Pages 258-272
Active Learning of Dynamic Bayesian Networks in Markov Decision Processes….Pages 273-284
Boosting MUS Extraction….Pages 285-299
Homogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage….Pages 300-313
Formalizing the Abstraction Process in Model-Based Diagnosis….Pages 314-328
Boolean Approximation Revisited….Pages 329-343
An Analysis of Map-Based Abstraction and Refinement….Pages 344-358
Solving Difficult SAT Instances Using Greedy Clique Decomposition….Pages 359-374
Abstraction and Complexity Measures….Pages 375-390
Abstraction, Emergence, and Thought….Pages 391-392
What’s Your Problem? The Problem of Problem Definition….Pages 393-394
A Reformulation-Based Approach to Explanation in Constraint Satisfaction….Pages 395-396
Integration of Constraint Programming and Metaheuristics….Pages 397-398
Rule-Based Reasoning Via Abstraction….Pages 399-399
Extensional Reasoning….Pages 400-401
Reformulating Constraint Models Using Input Data….Pages 402-404
Using Analogy Discovery to Create Abstractions….Pages 405-406
Distributed CSPs: Why It Is Assumed a Variable per Agent?….Pages 407-408
Decomposition of Games for Efficient Reasoning….Pages 409-410
Generalized Constraint Acquisition….Pages 411-412
Using Infeasibility to Improve Abstraction-Based Heuristics….Pages 413-414
Leveraging Graph Locality Via Abstraction….Pages 415-416
Back Matter….Pages –
Reviews
There are no reviews yet.