A Glimpse of Answer Set Programming

Answer Set Programming (ASP) is a declarative paradigm for solving search problems appearing in knowledge representation and reasoning. To solve a problem, a programmer designs a logic program so that models of the program determine solutions to the problem. ASP has been identified in the late 1990s as a subarea of logic programming and is becoming one of the fastest growing fields in knowledge representation and declarative programming. Major advantages of ASP are (1) its simplicity, (2) its ability to model effectively incomplete specifications and closure constraints, and (3) its relation to constraint satisfaction and propositional satisfiability, which allows one to take advantage of advances in these areas when designing solvers for ASP systems.

[1]  Thomas Linke,et al.  Graph Theoretical Characterization and Computation of Answer Sets , 2001, IJCAI.

[2]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

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

[4]  John S. Schlipf,et al.  The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..

[5]  Ilkka Niemelä,et al.  Logic Programs with Ordered Disjunction , 2004, Comput. Intell..

[6]  Chiaki Sakama,et al.  Prioritized logic programming and its application to commonsense reasoning , 2000, Artif. Intell..

[7]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

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

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

[10]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[11]  Torsten Schaub,et al.  Graphs and colorings for answer set programming: Abridged Report , 2004, Answer Set Programming.

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

[13]  Vladimir Lifschitz,et al.  Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.

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

[15]  Reijo Sulonen,et al.  Representing Configuration Knowledge With Weight Constraint Rules , 2001, Answer Set Programming.

[16]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

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

[18]  Esra Erdem,et al.  Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming , 2003, PADL.

[19]  Alexander A. Razborov,et al.  Why are there so many loop formulas? , 2006, TOCL.

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

[21]  Ilkka Niemelä,et al.  DES: a Challenge Problem for Nonmonotonic Reasoning Systems , 2000, ArXiv.

[22]  Hans Tompits,et al.  A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning , 2004, Comput. Intell..

[23]  Juliana Freire,et al.  XSB: A System for Effciently Computing WFS , 1997, LPNMR.

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

[25]  Miroslaw Truszczynski,et al.  Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative , 2004, LPNMR.

[26]  Stefan Woltran,et al.  A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report , 2002, NMR.

[27]  Piero A. Bonatti,et al.  Reasoning with infinite stable models , 2001, Artif. Intell..

[28]  Michael Gelfond,et al.  Diagnostic reasoning with A-Prolog , 2003, Theory Pract. Log. Program..

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

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

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

[32]  Torsten Schaub,et al.  A semantic framework for preference handling in answer set programming , 2003, Theory and Practice of Logic Programming.

[33]  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.

[34]  Marina De Vos,et al.  Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice , 2003, Answer Set Programming.

[35]  Wolfgang Faber,et al.  Experimenting with Heuristics for Answer Set Programming , 2001, IJCAI.

[36]  Gerhard Brewka,et al.  Complex Preferences for Answer Set Optimization , 2004, KR.

[37]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[38]  Victor W. Marek,et al.  On the Expressibility of Stable Logic Programming , 2001, LPNMR.

[39]  A RossKenneth,et al.  The well-founded semantics for general logic programs , 1991 .