An Extension to Conformant Planning Using Logic Programming

In this paper we extend the logic programming based conformant planner described in [Son et al., 2005a] to allow it to work on planning problems with more complex descriptions of the initial states. We also compare the extended planner with other concurrent conformant planners.

[1]  Wolfgang Faber,et al.  A logic programming approach to knowledge-state planning: Semantics and complexity , 2004, TOCL.

[2]  Tran Cao Son,et al.  Domain-dependent knowledge in answer set planning , 2002, TOCL.

[3]  Chitta Baral,et al.  Reasoning agents in dynamic domains , 2000 .

[4]  Yuliya Lierler,et al.  Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs , 2004, LPNMR.

[5]  Tran Cao Son,et al.  Conformant Planning for Domains with Constraints-A New Approach , 2005, AAAI.

[6]  Piergiorgio Bertoli,et al.  Conformant planning via symbolic model checking and heuristic search , 2004, Artif. Intell..

[7]  Tran Cao Son,et al.  On the Completeness of Approximation Based Reasoning and Planning in Action Theories with Incomplete Information , 2006, KR.

[8]  Leon Sterling,et al.  Relating Stable Models and AI Planning Domains , 1995 .

[9]  Carlo Zaniolo,et al.  Relating Stable Models and AI Planning Domains , 1995, ICLP.

[10]  Tran Cao Son,et al.  Approximation of action theories and its application to conformant planning , 2005, Artif. Intell..

[11]  Tran Cao Son,et al.  Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming , 2006, Theory and Practice of Logic Programming.

[12]  M. Gelfond,et al.  Encoding Conformant Planning in A-Prolog , .

[13]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[14]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[15]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[16]  Tran Cao Son,et al.  Formalizing sensing actions A transition function based approach , 2001, Artif. Intell..

[17]  Hudson Turner,et al.  Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach , 1997, J. Log. Program..

[18]  Armando Tacchella,et al.  SAT-based planning in complex domains: Concurrency, constraints and nondeterminism , 2003, Artif. Intell..