Pages that link to "Item:Q1583520"
From MaRDI portal
The following pages link to Computational complexity of planning and approximate planning in the presence of incompleteness (Q1583520):
Displayed 14 items.
- 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)
- Undoing the effects of action sequences (Q946576) (← links)
- Computational complexity of planning and approximate planning in the presence of incompleteness (Q1583520) (← links)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← 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)
- FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION (Q3427990) (← links)
- Practical reasoning about knowledge states for open world planning with sensing (Q3647290) (← links)
- Formalizing sensing actions -- a transition function based approach (Q5940779) (← links)