Pages that link to "Item:Q1583520"

The following pages link to Computational complexity of planning and approximate planning in the presence of incompleteness (Q1583520):

Displaying 33 items.

• Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
• Approximation of action theories and its application to conformant planning (Q543583) (← links)
• Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
• The complexity of achievement and maintenance problems in agent-based systems (Q814461) (← links)
• Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
• Probabilistic planning with clear preferences on missing information (Q835829) (← links)
• A history based approximate epistemic action theory for efficient postdictive reasoning (Q893597) (← links)
• Proof systems for planning under 0-approximation semantics (Q893736) (← links)
• A generic approach to planning in the presence of incomplete information: theory and implementation (Q899156) (← links)
• Undoing the effects of action sequences (Q946576) (← links)
• State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
• On the computational complexity of temporal projection, planning, and plan validation (Q1321058) (← links)
• Computational complexity of planning and approximate planning in the presence of incompleteness (Q1583520) (← links)
• Reasoning about actions with loops via Hoare logic (Q1712544) (← links)
• Approximate planning (Q1855231) (← links)
• Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
• Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
• Understanding planning tasks. Domain complexity and heuristic decomposition (Q2473931) (← links)
• The complexity of agent design problems: Determinism and history dependence (Q2502156) (← links)
• Representation and reasoning about evolutions of the world in the context of reasoning about actions (Q2574879) (← links)
• Reasoning about sensing actions in domains with multi-valued fluents (Q2574884) (← links)
• Knowledge-based programs as building blocks for planning (Q2667817) (← links)
• The complexity of optimal monotonic planning: the bad, the good, and the causal graph (Q2871457) (← links)
• Sufficient Conditions for the Existence of Resolution Complete Planning Algorithms (Q3020421) (← links)
• FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION (Q3427990) (← links)
• (Q3455599) (← links)
• Practical reasoning about knowledge states for open world planning with sensing (Q3647290) (← links)
• On transformation of conditional, conformant and parallel planning to linear programming (Q5010277) (← links)
• Planning with Incomplete Information in Quantified Answer Set Programming (Q5019607) (← links)
• Human Robot Collaborative Assembly Planning: An Answer Set Programming Approach (Q5140032) (← links)
• Formalizing sensing actions -- a transition function based approach (Q5940779) (← links)
• On the complexity of the storyplan problem (Q6172205) (← links)
• Planning with partial observability by SAT (Q6545568) (← links)