2006/05/04 by Phan Huy Tu, Tu, Phan Huy, Tran Cao Son +3
Computer Science · #AI-based Problem Solving and Planning #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #I.2.3 #I.2.4 #I.2.8 #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #cs.AI
paper · pdf · doi:10.48550/arxiv.cs/0605017
72 pages, 3 figures, a preliminary version of this paper appeared in the proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning, 2004. To appear in Theory and Practice of Logic Programming
arxiv created 2006/05/04 · openalex publication_date 2006/05/04 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We extend the 0-approximation of sensing actions and incomplete information in [Son and Baral 2000] to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation is NP-complete. We then present an answer set programming based conditional planner, called ASCP, that is capable of generating both conformant plans and conditional plans in the presence of sensing actions, incomplete information about the initial state, and static causal laws. We prove the correctness of our implementation and argue that our planner is sound and complete with respect to the proposed approximation. Finally, we present experimental results comparing ASCP to other planners.