Computational complexity of planning and approximate planning in the presence of incompleteness
From MaRDI portal
Publication:1583520
DOI10.1016/S0004-3702(00)00043-6zbMATH Open0948.68088OpenAlexW2017128525WikidataQ127011588 ScholiaQ127011588MaRDI QIDQ1583520FDOQ1583520
Authors: Chitta Baral, Vladik Kreinovich, Raul Trejo 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- The computational complexity of propositional STRIPS planning
- Representing action and change by logic programs
- Title not available (Why is that?)
- Complexity, decidability and undecidability results for domain-independent planning
- Computational complexity of planning and approximate planning in the presence of incompleteness
- Formalizing sensing actions -- a transition function based approach
- Title not available (Why is that?)
Cited In (34)
- Computational complexity of planning and approximate planning in the presence of incompleteness
- On transformation of conditional, conformant and parallel planning to linear programming
- Representation and reasoning about evolutions of the world in the context of reasoning about actions
- Conformant planning as a case study of incremental QBF solving
- Title not available (Why is that?)
- Probabilistic planning with clear preferences on missing information
- Formalizing sensing actions -- a transition function based approach
- Practical reasoning about knowledge states for open world planning with sensing
- Reasoning about actions with loops via Hoare logic
- Planning with Incomplete Information in Quantified Answer Set Programming
- Understanding planning tasks. Domain complexity and heuristic decomposition
- The complexity of optimal monotonic planning: the bad, the good, and the causal graph
- Reasoning about sensing actions in domains with multi-valued fluents
- Approximate planning
- Human robot collaborative assembly planning: an answer set programming approach
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- The complexity of agent design problems: Determinism and history dependence
- A history based approximate epistemic action theory for efficient postdictive reasoning
- Proof systems for planning under 0-approximation semantics
- On the complexity of the storyplan problem
- Knowledge-based programs as building blocks for planning
- Approximation of action theories and its application to conformant planning
- State-variable planning under structural restrictions: algorithms and complexity
- Title not available (Why is that?)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results
- A generic approach to planning in the presence of incomplete information: theory and implementation
- Refining complexity analyses in planning by exploiting the exponential time hypothesis
- FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION
- Sufficient Conditions for the Existence of Resolution Complete Planning Algorithms
- Planning with partial observability by SAT
- Undoing the effects of action sequences
- Enhancing disjunctive logic programming systems by SAT checkers
- The complexity of achievement and maintenance problems in agent-based systems
- On the computational complexity of temporal projection, planning, and plan validation
This page was built for publication: Computational complexity of planning and approximate planning in the presence of incompleteness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583520)
