Computational complexity of planning and approximate planning in the presence of incompleteness
From MaRDI portal
Publication:1583520
DOI10.1016/S0004-3702(00)00043-6zbMath0948.68088OpenAlexW2017128525WikidataQ127011588 ScholiaQ127011588MaRDI QIDQ1583520
Raul Trejo, Vladik Ya. Kreinovich, Chitta R. Baral
Publication date: 26 October 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00043-6
Related Items
Probabilistic planning with clear preferences on missing information, Maintenance goals of agents in a dynamic environment: formulation and policy construction, Conformant planning as a case study of incremental QBF solving, Knowledge-based programs as building blocks for planning, A history based approximate epistemic action theory for efficient postdictive reasoning, Proof systems for planning under 0-approximation semantics, A generic approach to planning in the presence of incomplete information: theory and implementation, Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results, Reasoning about actions with loops via Hoare logic, Human Robot Collaborative Assembly Planning: An Answer Set Programming Approach, Undoing the effects of action sequences, Approximation of action theories and its application to conformant planning, Formalizing sensing actions -- a transition function based approach, The complexity of agent design problems: Determinism and history dependence, Practical reasoning about knowledge states for open world planning with sensing, Computational complexity of planning and approximate planning in the presence of incompleteness, FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION, Representation and reasoning about evolutions of the world in the context of reasoning about actions, Reasoning about sensing actions in domains with multi-valued fluents, On transformation of conditional, conformant and parallel planning to linear programming, The complexity of achievement and maintenance problems in agent-based systems, Enhancing disjunctive logic programming systems by SAT checkers
Cites Work
- The computational complexity of propositional STRIPS planning
- Computational complexity of planning and approximate planning in the presence of incompleteness
- Complexity, decidability and undecidability results for domain-independent planning
- Representing action and change by logic programs
- Formalizing sensing actions -- a transition function based approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
