Abstract
The research on conditional planning rejects the assumptions that there is no uncertainty or incompleteness of knowledge with respect to the state and changes of the system the plans operate on. Without these assumptions the sequences of operations that achieve the goals depend on the initial state and the outcomes of nondeterministic changes in the system. This setting raises the questions of how to represent the plans and how to perform plan search. The answers are quite different from those in the simpler classical framework. In this paper, we approach conditional planning from a new viewpoint that is motivated by the use of satisfiability algorithms in classical planning. Translating conditional planning to formulae in the propositional logic is not feasible because of inherent computational limitations. Instead, we translate conditional planning to quantified Boolean formulae. We discuss three formalizations of conditional planning as quantified Boolean formulae, and present experimental results obtained with a theorem-prover.
Cited by
92 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A knowledge compilation perspective on queries and transformations for belief tracking;Annals of Mathematics and Artificial Intelligence;2024-01-31
2. Implementing BDI Continual Temporal Planning for Robotic Agents;2023 IEEE International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT);2023-10-26
3. Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. Planning with Partial Observability by SAT;Logics in Artificial Intelligence;2023
5. Answer Set Planning: A Survey;Theory and Practice of Logic Programming;2022-04-01