000 05705nam a22006015i 4500
001 978-3-540-44914-0
003 DE-He213
005 20240423132530.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540449140
_9978-3-540-44914-0
024 7 _a10.1007/3-540-44914-0
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aAbstraction, Reformulation, and Approximation
_h[electronic resource] :
_b4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26-29, 2000 Proceedings /
_cedited by Berthe Y. Choueiry, Toby Walsh.
250 _a1st ed. 2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2000.
300 _aXII, 336 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1864
505 0 _aInvited 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.
520 _aThis 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 conferences took place at Jackson Hole in Wyoming (1994), Ville d’Est´erel in Qu´ebec (1995), and Asilomar in California (1998). The symposium grewout of a series of workshops on abstraction, approximation, and reformulation that had taken place alongside AAAI since 1989. This year’s symposium was actually scheduled to take place at Lago Vista Clubs & Resort on Lake Travis but, due to the resort’s failure to pay taxes, the conference had to be moved late in the day. This mischance engendered eleventh-hour reformulations, abstractions, and resource re-allocations of its own. Such are the perils of organizing a conference. This is the ?rst SARA for which the proceedings have been published in the LNAI series of Springer-Verlag. We hope that this is a re?ection of the increased maturity of the ?eld and that the increased visibility brought by the publication of this volume will help the discipline grow even further. Abstractions, reformulations, and approximations (AR&A) have found - plications in a variety of disciplines and problems including automatic progr- ming, constraint satisfaction, design, diagnosis, machine learning, planning, qu- itative reasoning, scheduling, resource allocation, and theorem proving. The - pers in this volume capture a cross-section of these application domains.
650 0 _aArtificial intelligence.
650 0 _aSoftware engineering.
650 0 _aMachine theory.
650 0 _aComputer science.
650 1 4 _aArtificial Intelligence.
650 2 4 _aSoftware Engineering.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
700 1 _aChoueiry, Berthe Y.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWalsh, Toby.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540678397
776 0 8 _iPrinted edition:
_z9783662201282
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1864
856 4 0 _uhttps://doi.org/10.1007/3-540-44914-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188805
_d188805