Abstraction, Reformulation, and Approximation  7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings /  [electronic resource] : 
edited by Ian Miguel, Wheeler Tuml. 
 - 1st ed. 2007. 
 - XI, 420 p.  online resource. 
 - Lecture Notes in Artificial Intelligence,  4612  2945-9141 ; .
 - Lecture Notes in Artificial Intelligence,  4612 .
<br/><br/>Invited Talks (Abstracts) -- State Abstraction in Real-Time Heuristic Search -- Abstraction and Reformulation in the Generation of Constraint Models -- A Framework for Integrating Optimization and Constraint Programming -- Research Papers -- DFS-Tree Based Heuristic Search -- Partial Pattern Databases -- CDB-PV: A Constraint Database-Based Program Verifier -- Generating Implied Boolean Constraints Via Singleton Consistency -- Reformulating Constraint Satisfaction Problems to Improve Scalability -- Reformulating Global Constraints: The Slide and Regular Constraints -- Relaxation of Qualitative Constraint Networks -- Dynamic Domain Abstraction Through Meta-diagnosis -- Channeling Abstraction -- Approximate Model-Based Diagnosis Using Greedy Stochastic Search -- Combining Perimeter Search and Pattern Database Abstractions -- Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic -- Tailoring Solver-Independent Constraint Models: A Case Study with Essence? and Minion -- A Meta-CSP Model for Optimal Planning -- Reformulation for Extensional Reasoning -- An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus -- Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning -- Model-Based Exploration in Continuous State Spaces -- Active Learning of Dynamic Bayesian Networks in Markov Decision Processes -- Boosting MUS Extraction -- Homogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage -- Formalizing the Abstraction Process in Model-Based Diagnosis -- Boolean Approximation Revisited -- An Analysis of Map-Based Abstraction and Refinement -- Solving Difficult SAT Instances Using Greedy Clique Decomposition -- Abstraction and Complexity Measures -- Research Summaries -- Abstraction, Emergence, andThought -- What's Your Problem? The Problem of Problem Definition -- A Reformulation-Based Approach to Explanation in Constraint Satisfaction -- Integration of Constraint Programming and Metaheuristics -- Rule-Based Reasoning Via Abstraction -- Extensional Reasoning -- Reformulating Constraint Models Using Input Data -- Using Analogy Discovery to Create Abstractions -- Distributed CSPs: Why It Is Assumed a Variable per Agent? -- Decomposition of Games for Efficient Reasoning -- Generalized Constraint Acquisition -- Using Infeasibility to Improve Abstraction-Based Heuristics -- Leveraging Graph Locality Via Abstraction. 
<br/><br/><label>ISBN: </label>9783540735809 
<br/><br/><label>Standard No.: </label>10.1007/978-3-540-73580-9  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Artificial intelligence.<br/>Computer science.<br/>Machine theory.<br/>Artificial Intelligence.<br/>Theory of Computation.<br/>Formal Languages and Automata Theory.<br/>Computer Science Logic and Foundations of Programming.
<br/><br/><label>LC Class. No.: </label>Q334-342 TA347.A78 
<br/><br/><label>Dewey Class. No.: </label>006.3