000 05885nam a22005895i 4500
001 978-3-540-45622-3
003 DE-He213
005 20240423132531.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540456223
_9978-3-540-45622-3
024 7 _a10.1007/3-540-45622-8
_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] :
_b5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings /
_cedited by Sven Koenig, Robert C. Holte.
250 _a1st ed. 2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2002.
300 _aXI, 352 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 ;
_v2371
505 0 _aInvited Presentations -- Model Checking and Abstraction -- Reformulation in Planning -- Spatiotemporal Abstraction of Stochastic Sequential Processes -- State Space Relaxation and Search Strategies in Dynamic Programming -- Invited Presentations -- Admissible Moves in Two-Player Games -- Dynamic Bundling: Less Effort for More Solutions -- Symbolic Heuristic Search Using Decision Diagrams -- On the Construction of Human-Automation Interfaces by Formal Abstraction -- Pareto Optimization of Temporal Decisions -- An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection -- A Tractable Query Cache by Approximation -- An Algebraic Framework for Abstract Model Checking -- Action Timing Discretization with Iterative-Refinement -- Formalizing Approximate Objects and Theories: Some Initial Results -- Model Minimization in Hierarchical Reinforcement Learning -- Learning Options in Reinforcement Learning -- Approximation Techniques for Non-linear Problems with Continuum of Solutions -- Approximation of Relations by Propositional Formulas: Complexity and Semantics -- Abstracting Visual Percepts to Learn Concepts -- Short Presentations -- PAC Meditation on Boolean Formulas -- On the Reformulation of Vehicle Routing Problems and Scheduling Problems -- The Oracular Constraints Method -- Performance of Lookahead Control Policies in the Face of Abstractions and Approximations -- TTree: Tree-Based State Generalization with Temporally Abstract Actions -- Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction -- Research Summaries -- Abstracting Imperfect Information Game Trees -- Using Abstraction for Heuristic Search and Planning -- Approximation Techniques in Multiagent Learning -- Abstraction and Reformulation in GraphPlan -- Abstract Reasoning for Planning and Coordination -- Research Summary: Abstraction Techniques, and Their Value -- Reformulation of Non-binary Constraints -- Reformulating Combinatorial Optimization as Constraint Satisfaction -- Autonomous Discovery of Abstractions through Interaction with an Environment -- Interface Verification: Discrete Abstractions of Hybrid Systems -- Learning Semi-lattice Codebooks for Image Compression -- Research Summary -- Principled Exploitation of Heuristic Information -- Reformulation of Temporal Constraint Networks.
520 _aIt has been recognized since the inception of Artificial Intelligence (AI) that abstractions, problem reformulations, and approximations (AR&A) are central to human common sense reasoning and problem solving and to the ability of systems to reason effectively in complex domains. AR&A techniques have been used to solve a variety of tasks, including automatic programming, constraint satisfaction, design, diagnosis, machine learning, search, planning, reasoning, game playing, scheduling, and theorem proving. The primary purpose of AR&A techniques in such settings is to overcome computational intractability. In addition, AR&A techniques are useful for accelerating learning and for summarizing sets of solutions. This volume contains the proceedings of SARA 2002, the fifth Symposium on Abstraction, Reformulation, and Approximation, held at Kananaskis Mountain Lodge, Kananaskis Village, Alberta (Canada), August 2 4, 2002. The SARA series is the continuation of two separate threads of workshops: AAAI workshops in 1990 and 1992, and an ad hoc series beginning with the "Knowledge Compilation" workshop in 1986 and the "Change of Representation and Inductive Bias" workshop in 1988 with followup workshops in 1990 and 1992. The two workshop series merged in 1994 to form the first SARA. Subsequent SARAs were held in 1995, 1998, and 2000.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aMachine theory.
650 1 4 _aArtificial Intelligence.
650 2 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
700 1 _aKoenig, Sven.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aHolte, Robert C.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540439417
776 0 8 _iPrinted edition:
_z9783662193082
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v2371
856 4 0 _uhttps://doi.org/10.1007/3-540-45622-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188808
_d188808