LEADER 06471nam 22007215 450 001 9910143900703321 005 20200704005032.0 010 $a3-540-45622-8 024 7 $a10.1007/3-540-45622-8 035 $a(CKB)1000000000211775 035 $a(SSID)ssj0000320771 035 $a(PQKBManifestationID)11226739 035 $a(PQKBTitleCode)TC0000320771 035 $a(PQKBWorkID)10249070 035 $a(PQKB)11696987 035 $a(DE-He213)978-3-540-45622-3 035 $a(MiAaPQ)EBC3071976 035 $a(PPN)15522817X 035 $a(EXLCZ)991000000000211775 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAbstraction, Reformulation, and Approximation $e5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings /$fedited by Sven Koenig, Robert C. Holte 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XI, 352 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v2371 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43941-2 320 $aIncludes bibliographical references and index. 327 $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. 330 $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. 410 0$aLecture Notes in Artificial Intelligence ;$v2371 606 $aArtificial intelligence 606 $aComputers 606 $aLogic, Symbolic and mathematical 606 $aComputer logic 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 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$aComputers. 615 0$aLogic, Symbolic and mathematical. 615 0$aComputer logic. 615 14$aArtificial Intelligence. 615 24$aTheory of Computation. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 676 $a006.3 702 $aKoenig$b Sven$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHolte$b Robert C$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSARA 2002 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143900703321 996 $aAbstraction, Reformulation and Approximation$9772062 997 $aUNINA LEADER 01272cam0 22003013 450 001 SOB007455 005 20241108150000.0 010 $a8814087962 100 $a20000101d2001 |||||ita|0103 ba 101 $aita 102 $aIT 200 1 $aPercorsi e vicende attuali della rappresentanza e della responsabilità politica$eatti del Convegno$eMilano, 16-17 marzo 2000$fa cura di Nicolò Zanon e Francesca Biondi$g introduzione di Gustavo Zagrebelsky 210 $aMilano$cGiuffrè$d2001 215 $aXV, 301 p.$d24 cm 225 2 $aUniversità degli Studi di Milano$eFacoltà di Giurisprudenza$v46 410 1$1001LAEC00015426$12001 $a*Università degli Studi di Milano : Facoltà di Giurisprudenza$v46 702 1$aZanon, Nicolò$3AF00016872$4070 702 1$aBiondi, Francesca$3AF00018401$4070 702 1$aZagrebelsky, Gustavo$3AF00005466$4070 801 0$aIT$bUNISOB$c20241108$gRICA 850 $aUNISOB 852 $aUNISOB$j340$m107614 912 $aSOB007455 940 $aM 102 Monografia moderna SBN 941 $aM 957 $a340$b003363$gSI$d107614$rACQUISTO$1rovito$2UNISOB$3UNISOB$420230628095029.0$520230628095044.0$6rovito 996 $aPercorsi e vicende attuali della rappresentanza e della responsabilita politica$9703339 997 $aUNISOB