{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":27,"n_cols":5,"rows_kept":27,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466159703316"]
[null,null,"Titolo",null,"Recent Advances in AI Planning [[electronic resource] ] : 5th European Conference on Planning, ECP'99 Durham, UK, September 8-10, 1999 Proceedings / / edited by Susanne Biundo, Maria Fox"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000"]
[null,null,"ISBN",null,"3-540-44657-5"]
[null,null,"Edizione",null,"[1st ed. 2000.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 380 p.)"]
[null,null,"Collana",null,"Lecture Notes in Artificial Intelligence ; ; 1809"]
[null,null,"Disciplina",null,"006.3/33"]
[null,null,"Soggetti",null,"Artificial intelligence"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Numeric Computing"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Planning 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 "]
[{"$nulls":4},"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."]