LEADER 04687nam 22007695 450 001 996466159703316 005 20200702151841.0 010 $a3-540-44657-5 024 7 $a10.1007/10720246 035 $a(CKB)1000000000548884 035 $a(SSID)ssj0000326126 035 $a(PQKBManifestationID)11255376 035 $a(PQKBTitleCode)TC0000326126 035 $a(PQKBWorkID)10284067 035 $a(PQKB)10497448 035 $a(DE-He213)978-3-540-44657-6 035 $a(MiAaPQ)EBC3088357 035 $a(PPN)155220853 035 $a(EXLCZ)991000000000548884 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aRecent Advances in AI Planning$b[electronic resource] $e5th European Conference on Planning, ECP'99 Durham, UK, September 8-10, 1999 Proceedings /$fedited by Susanne Biundo, Maria Fox 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (VIII, 380 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v1809 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-67866-2 320 $aIncludes bibliographical references. 327 $aPlanning as Model Checking -- Conformant Planning via Model Checking -- Strong Cyclic Planning Revisited -- Scaleability in Planning -- Exploiting Competitive Planner Performance -- A Parallel Algorithm for POMDP Solution -- Plan Merging & Plan Reuse as Satisfiability -- SAT-Based Procedures for Temporal Reasoning -- Numeric State Variables in Constraint-Based Planning -- Hierarchical Task Network Planning as Satisfiability -- Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length -- Action Constraints for Planning -- Least Commitment on Variable Binding in Presence of Incomplete Knowledge -- Scaling up Planning by Teasing Out Resource Scheduling -- Real-Time Scheduling for Multi-agent Call Center Automation -- Task Decomposition Support to Reactive Scheduling -- Greedy Algorithms for the Multi-capacitated Metric Scheduling Problem -- Automata-Theoretic Approach to Planning for Temporally Extended Goals -- Integer Programs and Valid Inequalities for Planning Problems -- Deductive Synthesis of Recursive Plans in Linear Logic -- Sensor Planning with Non-linear Utility Functions -- Propice-Plan: Toward a Unified Framework for Planning and Execution -- What is the Expressive Power of Disjunctive Preconditions? -- Some Results on the Complexity of Planning with Incomplete Information -- Probabilistic Planning in the Graphplan Framework -- Making Graphplan Goal-Directed -- GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables -- Planning as Heuristic Search: New Results. 410 0$aLecture Notes in Artificial Intelligence ;$v1809 606 $aArtificial intelligence 606 $aComputer programming 606 $aComputers 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aArtificial intelligence. 615 0$aComputer programming. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 14$aArtificial Intelligence. 615 24$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aNumeric Computing. 615 24$aDiscrete Mathematics in Computer Science. 676 $a006.3/33 702 $aBiundo$b Susanne$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFox$b Maria$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aEuropean Conference on Planning 906 $aBOOK 912 $a996466159703316 996 $aRecent Advances in AI Planning$92120431 997 $aUNISA