Representing Knowledge in A-Prolog

In this paper, we review some recent work on declarative logic programming languages based on stable models/answer sets semantics of logic programs. These languages, gathered together under the name of A-Prolog, can be used to represent various types of knowledge about the world. By way of example we demonstrate how the corresponding representations together with inference mechanisms associated with A-Prolog can be used to solve various programming tasks.

[1]  Georg Gottlob,et al.  Default Logic as a Query Language , 1997, IEEE Trans. Knowl. Data Eng..

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

[3]  Michael Kaminski,et al.  A Note on the Stable Model Semantics for Logic Programs. (Research Note) , 1997, Artif. Intell..

[4]  Murray Shanahan.  Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .

[5]  Alfredo Gabaldon,et al.  Building a knowledge base: an example , 1999, Annals of Mathematics and Artificial Intelligence.

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

[7]  José Júlio Alferes,et al.  Reasoning with Logic Programming , 1996, Lecture Notes in Computer Science.

[8]  Ilkka Niemelä,et al.  Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.

[9]  Olga Kosheleva,et al.  Expanding Queries to Incomplete Databases by Interpolating General Logic Programs , 1998, J. Log. Program..

[10]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[11]  Vladimir Lifschitz,et al.  Restricted Monotonicity , 1993, AAAI.

[12]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[13]  Victor W. Marek,et al.  The Relationship Between Logic Program Semantics and Non-Monotonic Reasoning , 1989, ICLP.

[14]  Hudson Turner,et al.  Splitting a Default Theory , 1996, AAAI/IAAI, Vol. 1.

[15]  Wolfgang Faber,et al.  DLV - A System for Declarative Problem Solving , 2000, ArXiv.

[16]  Chitta Baral,et al.  Representing Actions: Laws, Observations and Hypotheses , 1997, J. Log. Program..

[17]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[18]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[19]  Patrik Simons,et al.  Extending the Stable Model Semantics with More Expressive Rules , 1999, LPNMR.

[20]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

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

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

[23]  Michael Gelfond,et al.  On consistency and completeness of autoepistemic theories , 1992, Fundamenta Informaticae.

[24]  Carlo Zaniolo,et al.  Relating Stable Models and AI Planning Domains , 1995, ICLP.

[25]  Martin D. F. Wong,et al.  Wire Routing and Satisfiability Planning , 2000, Computational Logic.

[26]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[27]  D. C. Dashfield.  HER MAJESTY'S STATIONERY OFFICE , 1954 .

[28]  Dietmar Seipel,et al.  DisLog - A System for Reasoning in Disjunctive Deductive Databases , 1994 .

[29]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[30]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[31]  Hudson Turner,et al.  Signed Logic Programs , 1994, ILPS.

[32]  David Pearce,et al.  From Here to There: Stable Negation in Logic Programming , 1999 .

[33]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

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

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

[36]  Torsten Schaub,et al.  Compiling Reasoning with and about Preferences into Default Logic , 1997, IJCAI.

[37]  Vladimir Lifschitz,et al.  On the Logic of Causal Explanation (Research Note) , 1997, Artif. Intell..

[38]  G. Antoniou.  Stable Model Semantics of Logic Programs , 1997 .

[39]  Pawel Cholewinski.  Reasoning with Stratified Default Theories , 1995, LPNMR.

[40]  Wolfgang Faber,et al.  Declarative problem-solving in DLV , 2001 .

[41]  Nicola Leone,et al.  Stable Model Checking Made Easy , 1999, IJCAI.

[42]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[43]  Krzysztof R. Apt,et al.  On the occur-check-free PROLOG programs , 1994, TOPL.

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

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

[46]  John McCarthy,et al.  Programs with common sense , 1960 .

[47]  Georg Gottlob,et al.  Complexity aspects of various semantics for disjunctive databases , 1993, PODS '93.

[48]  M. Gelfond,et al.  Disjunctive Defaults , 1991 .

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

[50]  Jürgen Dix,et al.  DisLoP: A Research Project on Disjunctive Logic Programming , 1997, AI Commun..

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

[52]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[53]  Gerald Pfeifer,et al.  A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.

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

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

[56]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[57]  Vladimir Lifschitz,et al.  Two components of an action language , 1997, Annals of Mathematics and Artificial Intelligence.

[58]  Hudson Turner,et al.  Satisfiability planning with Causal Theories , 1998, KR.

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

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

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

[62]  I. Niemelä,et al.  Extending the Smodels system with cardinality and weight constraints , 2001 .

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

[64]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[65]  Wolfgang Faber,et al.  Declarative problem-solving using the DLV system , 2000 .

[66]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[67]  Chitta Baral,et al.  Reasoning agents in dynamic domains , 2000 .

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

[69]  David Nelson,et al.  Constructible falsity , 1949, Journal of Symbolic Logic.

[70]  Karl Stroetmann,et al.  A Completeness Result for SLDNF-Resolution , 1993, J. Log. Program..

[71]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[72]  Teodor C. Przymusinski.  Perfect Model Semantics , 1988, ICLP/SLP.

[73]  D. Gabbay,et al.  What is Negation , 1999 .

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

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

[76]  Antonis C. Kakas,et al.  The role of abduction in logic programming , 1998 .

[77]  Michael Thielscher,et al.  Ramification and Causality , 1997, Artif. Intell..

[78]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[79]  Luigi Portinale,et al.  On the role of abduction , 1995, CSUR.

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

[81]  Pawel Cholewinski.  Stratified Default Theories , 1994, CSL.

[82]  Tran Cao Son,et al.  Reasoning with Prioritized Defaults , 1997, LPKR.

[83]  Phan Minh Dung,et al.  An Abstract, Argumentation-Theoretic Approach to Default Reasoning , 1997, Artif. Intell..

[84]  M. Mowbray,et al.  A Completeness Result for SLDNF-Resolution , 1993, GULP.

[85]  Victor W. Marek,et al.  Default Reasoning System DeReS , 1996, KR.

[86]  David Scott Warren,et al.  Efficient Top-Down Computation of Queries under the Well-Founded Semantics , 1995, J. Log. Program..

[87]  Gerd Wagner,et al.  Logic Programming with Strong Negation and Inexact Predicates , 1991, J. Log. Comput..

[88]  Chiaki Sakama,et al.  Negation as Failure in the Head , 1998, J. Log. Program..

[89]  Fahiem Bacchus,et al.  Planning for temporally extended goals , 1996, Annals of Mathematics and Artificial Intelligence.