LEADER 06276nam 22006855 450 001 9910768434203321 005 20231129185243.0 010 $a3-540-44914-0 024 7 $a10.1007/3-540-44914-0 035 $a(CKB)1000000000211279 035 $a(SSID)ssj0000320770 035 $a(PQKBManifestationID)11230056 035 $a(PQKBTitleCode)TC0000320770 035 $a(PQKBWorkID)10257865 035 $a(PQKB)11696746 035 $a(DE-He213)978-3-540-44914-0 035 $a(MiAaPQ)EBC3073195 035 $a(PPN)15517391X 035 $a(EXLCZ)991000000000211279 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAbstraction, Reformulation, and Approximation $e4th International Symposium, SARA 2000 Horseshoe Bay, USA, July 26-29, 2000 Proceedings /$fedited by Berthe Y. Choueiry, Toby Walsh 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XII, 336 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v1864 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67839-5 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $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. 330 $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 grew out 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 first SARA for which the proceedings have been published in the LNAI series of Springer-Verlag. We hope that this is a reflection of the increased maturity of the field 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 programming, constraint satisfaction, design, diagnosis, machine learning, planning, qualitative reasoning, scheduling, resource allocation, and theorem proving. The - pers in this volume capture a cross-section of these application domains. 410 0$aLecture Notes in Artificial Intelligence ;$v1864 606 $aArtificial intelligence 606 $aSoftware engineering 606 $aMathematical logic 606 $aComputer logic 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 615 0$aArtificial intelligence. 615 0$aSoftware engineering. 615 0$aMathematical logic. 615 0$aComputer logic. 615 14$aArtificial Intelligence. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 676 $a006.3 702 $aChoueiry$b Berthe Y$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWalsh$b Toby$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSARA 2000 906 $aBOOK 912 $a9910768434203321 996 $aAbstraction, Reformulation and Approximation$9772062 997 $aUNINA