Abstraction, Reformulation, and Approximation 4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26-29, 2000 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Choueiry, Berthe Y. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Walsh, Toby (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Artificial Intelligence ; 1864
• Θέματα: Artificial intelligence.; Software engineering.; Mathematical logic.; Computer logic.; Artificial Intelligence.; Software Engineering/Programming and Operating Systems.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.

This volume contains the proceedings of SARA 2000, the fourth Symposium on Abstraction, Reformulations, and Approximation (SARA). The conference was held at Horseshoe Bay Resort and Conference Club, Lake LBJ, Texas, July 26- 29, 2000, just prior to the AAAI 2000 conference in Austin. Previous SARA c...

Πίνακας περιεχομένων:

• 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.