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.

Citations

1555	STRIPS: A new approach to the application of theorem proving to problem solving - Fikes, Nilsson - 1971
1263	The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
1247	A logic for default reasoning - Reiter - 1980
855	Negation as Failure - Clark - 1978
362	Planning as satisfiability - Kautz, Selman - 1992
355	Representing actions and change by logic programs - Gelfond, Lifschitz - 1993
310	Logic programs with classical negation - Gelfond, Lifschitz - 1990
265	ADL: Exploring the middle ground between STRIPS and the situation calculus - Pednault - 1998
264	Logic programs with stable model semantics as a constraint programming paradigm - Niemelä - 1999
233	Nonmonotonic logic and temporal projection - Hanks, McDermott - 1987
197	Stable Models as an Alternative Logic Programming Paradigm - Marek, Truszczyński - 1999
158	Action languages - Gelfond, Lifschitz - 1998
154	Causal theories of action and change - McCain, Turner - 1997
127	Answer set planning - Lifschitz - 1999
121	Consistency of Clark’s completion and existence of stable models - Fages - 1994
108	An action language based on causal explanation: preliminary report - Giunchiglia, Lifschitz
102	Encoding planning problems in nonmonotonic logic programs - DIMOPOULOS, NEBEL, et al. - 1997
98	Answer sets in general nonmonotonic reasoning (preliminary report - Lifschitz, Woo - 1992
84	The logic of persistence - Kautz - 1986
77	Representing actions in logic programs and default theories - Turner - 1997
48	Using Logic Programs with Stable Model Semantics to Solve Dead-Lock and Reachability Problems for 1-Safe Petri Nets - Heljanko - 1999
45	Action Languages, Answer Sets, and Planning - Lifschitz - 1999
43	Relating stable models and AI planning domains - Subrahmanian, Zaniolo - 1995
39	Representing transition systems by logic programs - Lifschitz, Turner - 1999
37	Minimalism subsumes default logic and circumscription in stratified logic programming - Bidoit, Froidevaux - 1987
31	Autoepistemic logic and formalization of commonsense reasoning, preliminary report - Gelfond - 1988
31	Simple causal minimization for temporal persistence and projection - Haugh - 1987
31	Planning as Satis - Kautz, Selman - 1992
30	Pointwise circumscription: Preliminary report - Lifschitz - 1986
27	Fages’ theorem and answer set programming - Babovich, Erdem, et al. - 2000
27	The anomalous extension problem in default reasoning - Morris - 1988
26	Formal theories of action (preliminary report - Lifschitz
23	Chronological ignorance: Time, nonmonotonicity, necessity and causal theories - Shoham - 1986
15	An Application of Action Theory to the Space Shuttle - Watson - 1999
12	Transformations of logic programs related to causality and planning - Erdem, Lifschitz - 1999
7	and Mirek Truszczynski. Stable semantics for logic programs and default theories - Marek - 1989
4	Control knowledge in planning: Bene and tradeos - Huang, Selman, et al. - 1999
4	Miros law Truszczynski. Stable models and an alternative logic programming paradigm - Marek - 1999
2	Timo Soininen. Extending the stable model semantics. This journal - Niemela, Simons
1	Miros law Truszczynski. Stable semantics for logic programs and default theories - Marek - 1989