Abstraction, Reformulation, and Approximation

7th International Symposium, SARA 2007 Whistler, Canada, July 1 18-21, 2007 Proceedings

By: Ian Miguel (Editor), Wheeler Tuml (Editor)

Write A Review

Paperback | 4 July 2007

At a Glance

Paperback
434 Pages

Dimensions(cm)
22.86 x 15.24 x 2.54

Paperback

$143.99

or 4 interest-free payments of $36.00 with

Ships in 10 to 15 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Artificial Intelligence Computer Architecture & Logic Design Mathematics Mathematical Foundation Mathematical Logic Mathematical Theory of Computation Computer Programming & Software Development

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.

Abstraction, Reformulation, and Approximation

7th International Symposium, SARA 2007 Whistler, Canada, July 1 18-21, 2007 Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Mathematical Theory of Computation

Artificial Intelligence in Modeling and Simulation

Simulation Foundations, Methods and Applications

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Discrete Mathematics for Computing

Grassroots

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

AI Engineering

Building Applications with Foundation Models

Effective Machine Learning Teams

Best Practices for ML Practitioners

Decentralized Futures

Navigating the Integration of Blockchain Technology with Artificial Intelligence

Foundation Mathematics

Introduction to Modern Cryptography

Revised Third Edition

Machine Learning Interviews

Kickstart Your Machine Learning and Data Career

BEADING WITH ALGORITHMS

CELLULAR AUTOMATA IN PEYOTE STITCH

Ten Software Patterns Every Student Should Know

Applied Mathematics with F#

Python Essentials

Symbolic and Numeric Problem-Solving in Engineering

Axiomatic Set Theory

An Introduction

Graphical Models and Causal Discovery with Python

100 Exercises for Building Logic

Tools for High Performance Computing 2024

Proceedings of the 15th International Workshop on Parallel Tools for High Performance Computing

AI Value Creators

Beyond the Generative AI User Mindset

Hands-On Generative AI with Transformers and Diffusion Models

Practical Weak Supervision

Doing More with Less Data

Software Engineering and Formal Methods. SEFM 2025 Collocated Workshops

ReacTS 2025 and CIFMA 2025, Toledo, Spain, November 11, 2025, Revised Selected Papers

Advanced Computing in Industrial Mathematics

19th Annual Meeting of the Bulgarian Section of SIAM December 11-13, 2024, Sofia, Bulgaria Revised Selected Papers

Network model selection

A review of methods

This product is categorised by