Answer set programming and plan generation

Abstract The idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as smodels or dlv , to find an answer set for this program. Applications of this method to planning are related to the line of research on the frame problem that started with the invention of formal nonmonotonic reasoning in 1980.

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

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

[3]  Bart Selman,et al.  Control Knowledge in Planning: Benefits and Tradeoffs , 1999, AAAI/IAAI.

[4]  Vladimir Lifschitz,et al.  Formal Theories of Action (Preliminary Report) , 1987, IJCAI.

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

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

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

[8]  Christine Froidevaux,et al.  Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming , 1987, LICS.

[9]  Vladimir Lifschitz,et al.  Answer Set Planning (Abstract) , 1999, LPNMR.

[10]  Keijo Heljanko,et al.  Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets , 1999, Fundam. Informaticae.

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

[12]  Yoav Shoham,et al.  Chronological Ignorance: Time, Nonmonotonicity, Necessity and Causal Theories , 1986, AAAI.

[13]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[14]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[15]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[16]  Drew McDermott,et al.  Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..

[17]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[18]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

[19]  Michael Gelford,et al.  Autoepistemic logic and formalization of commonsense reasoning: preliminary report , 1989 .

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

[21]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

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

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

[24]  Vladimir Lifschitz,et al.  Pointwise Circumscription: Preliminary Report , 1986, AAAI.

[25]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..

[26]  Yuliya Lierler,et al.  Fages' Theorem and Answer Set Programming , 2000, ArXiv.

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

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

[29]  Henry A. Kautz The Logic of Persistence , 1986, AAAI.

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

[31]  Vladimir Lifschitz,et al.  Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) , 1992, KR.

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

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

[34]  Paul H. Morris,et al.  The Anomalous Extension Problem in Default Reasoning , 1988, Artif. Intell..

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

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

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

[38]  Richard Watson,et al.  An Application of Action Theory to the Space Shuttle , 1999, PADL.

[39]  Brian A. Haugh,et al.  Simple Causal Minimizations for Temporal Persistence and Projection , 1987, AAAI.

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