Abstraction, Reformulation, and Approximation: 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings by Ian MiguelAbstraction, Reformulation, and Approximation: 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings by Ian Miguel

Abstraction, Reformulation, and Approximation: 7th International Symposium, SARA 2007, Whistler…

byIan MiguelEditorWheeler Tuml

Paperback | July 4, 2007

Pricing and Purchase Info

$126.67 online 
$151.95 list price save 16%
Earn 633 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This is a subject that is as hot as a snake in a wagon rut, offering as it does huge potentiality in the field of computer programming. 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. 26 revised full papers are presented, together with the abstracts of 3 invited papers and 13 research summaries.

Title:Abstraction, Reformulation, and Approximation: 7th International Symposium, SARA 2007, Whistler…Format:PaperbackDimensions:420 pages, 23.5 × 15.5 × 0.01 inPublished:July 4, 2007Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540735798

ISBN - 13:9783540735793

Look for similar items by category:

Reviews

Table of Contents

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, and Thought.- 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.