Abstraction, Reformulation, and Approximation: 4th International Symposium, Sara 2000 Horseshoe Bay, Usa, July 26-29, 2000Proceedings

Choueiry, Berthe Y. (Editor)/ Walsh, Toby (Editor)

ISBN 10: 3540678395 / ISBN 13: 9783540678397

Editore: Springer Verlag, 2000

Riguardo questo articolo

1st edition. 331 pages. 9.50x6.25x0.75 inches. In Stock.

Codice articolo x-3540678395

Dati bibliografici

• Titolo: Abstraction, Reformulation, and Approximation: 4th International Symposium, Sara 2000 Horseshoe Bay, Usa, July 26-29, 2000Proceedings
• Editore: Springer Verlag
• Data di pubblicazione: 2000
• Lingua: Inglese
• ISBN 10: 3540678395
• ISBN 13: 9783540678397
• Rilegatura: Paperback
• Condizione: Brand New
• Peso: 0,45 chilogrammi

Descrizione articolo

Riassunto

This book constitues the refereed proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation, SARA 2000, held at Lake LBJ, Texas, USA in July 2000. The nine revised full papers presented together with five extended abstracts, three posters, seven research summaries, and four invited papers were carefully reviewed and selected for inclusion in the book. The book addresses all current aspects of abstraction, reformulation, and approximation and applications in areas like automatic programming, constraint satisfaction, design, diagnosis, inductive logic programming, computational learning, planning, resource allocation, theorem proving, qualitative reasoning, relational databases, etc.

Contenuti

Invited Talks.- Partial Completeness of Abstract Fixpoint Checking.- An Overview of MAXQ Hierarchical Reinforcement Learning.- Recent Progress in the Design and Analysis of Admissible Heuristic Functions.- Tutorial.- GIS Databases: From Multiscale to MultiRepresentation.- Full Papers.- An Abstraction Framework for Soft Constraints and Its Relationship with Constraint Propagation.- Abstractions for Knowledge Organization of Relational Descriptions.- Grid-Based Histogram Arithmetic for the Probabilistic Analysis of Functions.- Approximating Data in Constraint Databases.- Linearly Bounded Reformulations of Unary Databases.- A CSP Abstraction Framework.- Interactions of Abstractions in Programming.- Reformulation and Approximation in Model Checking.- The Lumberjack Algorithm for Learning Linked Decision Forests.- Reformulating Propositional Satisfiability as Constraint Satisfaction.- Extended Abstracts.- Improving the Efficiency of Reasoning Through Structure-Based Reformulation.- Using Feature Hierarchies in Bayesian Network Learning.- On Reformulating Planning as Dynamic Constraint Satisfaction.- Experiments with Automatically Created Memory-Based Heuristics.- Abstraction and Phase Transitions in Relational Learning.- Posters.- An Agent-Based Approach to Robust Switching Between Abstraction Levels for Fault Diagnosis.- A Compositional Approach to Causality.- A Method for Finding Consistent Hypotheses Using Abstraction.- Research Summaries.- Program Synthesis and Transformation Techniques for Simulation, Optimization, and Constraint Satisfaction.- Using and Learning Abstraction Hierarchies for Planning.- Learning Probabilistic Relational Models.- Synergy between Compositional Modeling and Bayesian Networks.- A CSP Abstraction Framework.- Answering Queries with Database Restrictions.- Research Summary.