USA-Smart: Improving the Quality of Plans in Answer Set Planning

In this paper we show how CR-Prolog, a recent extension of A-Prolog, was used in the successor of USA-Advisor (USA-Smart) in order to improve the quality of the plans returned. The general problem that we address is that of improving the quality of plans by taking in consideration statements that describe “most desirable” plans. We believe that USA-Smart proves that CR-Prolog provides a simple, elegant, and flexible solution to this problem, and can be easily applied to any planning domain. We also discuss how alternative extensions of A-Prolog can be used to obtain similar results.

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

[2]  Michael Gelfond,et al.  The USA-Advisor: A Case Study in Answer Set Planning , 2001, LPNMR.

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

[4]  Georg Gottlob,et al.  The DLV System , 2002, JELIA.

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

[6]  Daniel S. Weld.  Recent Advances in AI Planning , 1999, AI Mag..

[7]  Michael Gelfond,et al.  An A Prolog decision support system for the Space Shuttle , 2001, Answer Set Programming.

[8]  Vladimir Lifschitz,et al.  Definitions in Answer Set Programming: (Extended Abstract) , 2003, ICLP.

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

[10]  Gerhard Brewka,et al.  Logic programming with ordered disjunction , 2002, NMR.

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

[12]  Marcello Balduccini,et al.  CR-Prolog2: CR-Prolog with Ordered Disjunction , 2003 .

[13]  Ilkka Niemelä,et al.  Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs , 2002, JELIA.

[14]  Ilkka Niemelä,et al.  Logic Programming and Nonmonotonic Reasoning 7th International Conference, Lpnmr 2004, Fort Lauderdale, Fla., January 6-8, 2004 : Proceedings , 2004 .

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

[16]  Fangzhen Lin,et al.  ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..

[17]  Michael Gelfond,et al.  Building knowledge systems in a-prolog , 2005 .

[18]  Enrico Pontelli,et al.  Non-monotonic Reasoning on Beowulf Platforms , 2003, PADL.

[19]  Antonis C. Kakas,et al.  Computational Logic: Logic Programming and Beyond , 2002, Lecture Notes in Computer Science.

[20]  Michael Gelfond,et al.  Representing Knowledge in A-Prolog , 2002, Computational Logic: Logic Programming and Beyond.

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

[22]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[23]  Michael Gelfond,et al.  Logic Programs with Consistency-Restoring Rules , 2003 .