COVID-19: Updates on library services and operations.

Abstraction, reformulation, and approximation : 7th international symposium, SARA 2007, Whistler, Canada, July 18-21, 2007 : proceedings /
Ian Miguel, Wheeler Ruml (eds.).
Berlin ; New York : Springer, c2007.
xi, 418 p. : ill. ; 24 cm.
3540735798 (pbk.), 9783540735793 (pbk.)
A Look Inside
Long Description
This book constitutes the refereed proceedings of the 7th International Symposium on Abstraction, Reformulation, and Approximation, SARA 2007, held in Whistler, Canada, in July 2007. The 26 revised full papers presented together with the abstracts of 3 invited papers and 13 research summaries were carefully reviewed and selected for inclusion in the book. 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 modelling, constraint programming, design, diagnosis, machine learning, model-based reasoning, planning, reasoning, scheduling, search, theorem proving, and tutoring.
Main Description
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.
Table of Contents
Invited Talks (Abstracts)
State Abstraction in Real-Time Heuristic Searchp. 1
Abstraction and Reformulation in the Generation of Constraint Modelsp. 2
A Framework for Integrating Optimization and Constraint Programmingp. 4
Research Papers
DFS-Tree Based Heuristic Searchp. 5
Partial Pattern Databasesp. 20
CDB-PV: A Constraint Database-Based Program Verifierp. 35
Generating Implied Boolean Constraints Via Singleton Consistencyp. 50
Reformulating Constraint Satisfaction Problems to Improve Scalabilityp. 64
Reformulating Global Constraints: The Slide and Regular Constraintsp. 80
Relaxation of Qualitative Constraint Networksp. 93
Dynamic Domain Abstraction Through Meta-diagnosisp. 109
Channeling Abstractionp. 124
Approximate Model-Based Diagnosis Using Greedy Stochastic Searchp. 139
Combining Perimeter Search and Pattern Database Abstractionsp. 155
Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logicp. 169
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minionp. 184
A Meta-CSP Model for Optimal Planningp. 200
Reformulation for Extensional Reasoningp. 215
An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculusp. 230
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planningp. 243
Model-Based Exploration in Continuous State Spacesp. 258
Active Learning of Dynamic Bayesian Networks in Markov Decision Processesp. 273
Boosting MUS Extractionp. 285
Homogeneous Hierarchical Composition of Areas in Multi-robot Area Coveragep. 300
Formalizing the Abstraction Process in Model-Based Diagnosisp. 314
Boolean Approximation Revisitedp. 329
An Analysis of Map-Based Abstraction and Refinementp. 344
Solving Difficult SAT Instances Using Greedy Clique Decompositionp. 359
Abstraction and Complexity Measuresp. 375
Research Summaries
Abstraction, Emergence, and Thoughtp. 391
What's Your Problem? The Problem of Problem Definitionp. 393
A Reformulation-Based Approach to Explanation in Constraint Satisfactionp. 395
Integration of Constraint Programming and Metaheuristicsp. 397
Rule-Based Reasoning Via Abstractionp. 399
Extensional Reasoningp. 400
Reformulating Constraint Models Using Input Datap. 402
Using Analogy Discovery to Create Abstractionsp. 405
Distributed CSPs: Why It Is Assumed a Variable per Agent?p. 407
Decomposition of Games for Efficient Reasoningp. 409
Generalized Constraint Acquisitionp. 411
Using Infeasibility to Improve Abstraction-Based Heuristicsp. 413
Leveraging Graph Locality Via Abstractionp. 415
Author Indexp. 417
Table of Contents provided by Ingram. All Rights Reserved.

This information is provided by a service that aggregates data from review sources and other sources that are often consulted by libraries, and readers. The University does not edit this information and merely includes it as a convenience for users. It does not warrant that reviews are accurate. As with any review users should approach reviews critically and where deemed necessary should consult multiple review sources. Any concerns or questions about particular reviews should be directed to the reviewer and/or publisher.

  link to old catalogue

Report a problem