论文信息 - Answer Set Planning (Abstract)

Answer Set Planning (Abstract)

In “answer set programming”[5,7] solutions to a problem are represented by answer sets (known also as stable models), and not by answer substitutions produced in response to a query, as in conventional logic programming. Instead of Prolog, answer set programming uses software systems capable of computing answer sets. Four such systems were demonstrated at the Workshop on Logic- Based AI held in June of 1999 in Washington, DC: dlv1, smodels,2, DeReS3 and ccalc4.

Vladimir Lifschitz | V. Lifschitz

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

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

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

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

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

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

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

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