Answer Set Planning under Action Costs

Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language κc, which extends the declarative planning language κ by action costs. κc provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all plans (i.e., cheapest plans). As we demonstrate, this novel language allows for expressing some nontrivial planning tasks in a declarative way. Furthermore, it can be utilized for representing planning problems under other optimality criteria, such as computing "shortest" plans (with the least number of steps), and refinement combinations of cheapest and fastest plans. We study complexity aspects of the language κc and provide a transformation to logic programs, such that planning problems are solved via answer set programming. Furthermore, we report experimental results on selected problems. Our experience is encouraging that answer set planning may be a valuable approach to expressive planning systems in which intricate planning problems can be naturally specified and solved.

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

[2]  Paolo Traverso,et al.  State-Space Planning , 2004 .

[3]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[4]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[5]  Joohyung Lee,et al.  Additive Fluents , 2001, Answer Set Programming.

[6]  Hudson Turner,et al.  Satisfiability planning with Causal Theories , 1998, KR.

[7]  Victor W. Marek,et al.  The Logic Programming Paradigm: A 25-Year Perspective , 2011 .

[8]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[9]  Danny De Schreye,et al.  Answer Set Planning , 1999 .

[10]  Enrico Giunchiglia,et al.  Planning as Satisfiability in Nondeterministic Domains , 2000, AAAI/IAAI.

[11]  Wolfgang Faber,et al.  DLV - A System for Declarative Problem Solving , 2000, ArXiv.

[12]  Ilkka Niemelä,et al.  Developing a Declarative Rule Language for Applications in Product Configuration , 1999, PADL.

[13]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[14]  Fangzhen Lin,et al.  State Constraints Revisited , 1994, J. Log. Comput..

[15]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

[16]  Victor W. Marek,et al.  Stable Semantics for Logic Programs and Default Theories , 1989, NACLP.

[17]  Wolfgang Faber,et al.  Planning under Incomplete Knowledge , 2000, Computational Logic.

[18]  Wolfgang Faber,et al.  Declarative problem-solving using the DLV system , 2000 .

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

[20]  Enrico Giunchiglia,et al.  An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.

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

[22]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[23]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

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

[25]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[26]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[27]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[28]  Francesco Buccafurri,et al.  Enhancing Disjunctive Datalog by Constraints , 2000, IEEE Trans. Knowl. Data Eng..

[29]  Vladimir Lifschitz,et al.  Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.

[30]  David E. Smith,et al.  Conformant Graphplan , 1998, AAAI/IAAI.

[31]  Esra Erdem,et al.  Applications of Logic Programming to Planning: Computational Experiments , 1999 .

[32]  Alexander Nareyek.  Beyond the Plan-Length Criterion , 2000, Local Search for Planning and Scheduling.

[33]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

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

[35]  Steve Hanks,et al.  Optimal Planning with a Goal-directed Utility Model , 1994, AIPS.

[36]  Francesco Buccafurri,et al.  Strong and Weak Constraints in Disjunctive Datalog , 1997, LPNMR.

[37]  David E. Smith,et al.  Extending Graphplan to Handle Uncertainty & Sensing Actions , 1998, AAAI/IAAI.

[38]  Enrico Giunchiglia,et al.  Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism , 2000, KR.

[39]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[40]  Henry A. Kautz,et al.  State-space Planning by Integer Optimization , 1999, AAAI/IAAI.

[41]  Vladimir Lifschitz,et al.  Representing Transition Systems by Logic Programs , 1999, LPNMR.

[42]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[43]  Marco Roveri,et al.  Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..

[44]  Mark W. Krentel.  Generalizations of Opt P to the Polynomial Hierarchy , 1992, Theor. Comput. Sci..

[45]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[46]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[47]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[48]  Wolfgang Faber,et al.  Disjunctive datalog with strong and weak constraints: Representational and computational issues , 1998 .

[49]  Murray Shanahan.  Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .

[50]  Esra Erdem,et al.  Transformations of Logic Programs Related to Causality and Planning , 1999, LPNMR.

[51]  Eithan Ephrati,et al.  A Cost-Directed Planner: Preliminary Report , 1996, AAAI/IAAI, Vol. 2.

[52]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[53]  Jana Koehler,et al.  Planning under Resource Constraints , 1998, ECAI.

[54]  Wolfgang Faber,et al.  Answer Set Planning under Action Costs , 2002, JELIA.

[55]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[56]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

[57]  R. Bryant.  Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .

[58]  Alan L. Selman,et al.  A Taxonomy of Complexity Classes of Functions , 1994, J. Comput. Syst. Sci..

[59]  Enrico Pontelli,et al.  Reasoning about Actions in Prioritized Default Theory , 2002, JELIA.