Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach

Knowledge representation and reasoning is the foundation of artificial intelligence, declarative programming, and the design of knowledge-intensive software systems capable of performing intelligent tasks. Using logical and probabilistic formalisms based on answer set programming (ASP) and action languages, this book shows how knowledge-intensive systems can be given knowledge about the world and how it can be used to solve non-trivial computational problems. The authors maintain a balance between mathematical analysis and practical design of intelligent agents. All the concepts, such as answering queries, planning, diagnostics, and probabilistic reasoning, are illustrated by programs of ASP. The text can be used for AI-related undergraduate and graduate classes and by researchers who would like to learn more about ASP and knowledge representation.

[1]  Hans Tompits,et al.  A framework for compiling preferences in logic programs , 2002, Theory and Practice of Logic Programming.

[2]  Esra Erdem,et al.  Tight logic programs , 2003, Theory and Practice of Logic Programming.

[3]  Vladimir Lifschitz,et al.  Formalizing Common Sense: Papers by John McCarthy , 1998 .

[4]  Torsten Schaub,et al.  ASP modulo CSP: The clingcon system , 2012, Theory Pract. Log. Program..

[5]  Pierangelo Miglioli,et al.  PAP: A Logic Programming System Based on a Constructive Logic , 1986, Foundations of Logic and Functional Programming.

[6]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[7]  David Pearce,et al.  Equilibrium logic , 2006, Annals of Mathematics and Artificial Intelligence.

[8]  Christine Froidevaux,et al.  Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming , 1987, LICS.

[9]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[10]  Teodor C. Przymusinski.  On the declarative and procedural semantics of logic programs , 1989, Journal of Automated Reasoning.

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

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

[13]  G. Boole.  An Investigation of the Laws of Thought: On which are founded the mathematical theories of logic and probabilities , 2007 .

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

[15]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

[16]  Alain Colmerauer,et al.  The birth of Prolog , 1996 .

[17]  Michael Gelfond,et al.  The AAA Architecture: An Overview , 2008, AAAI Spring Symposium: Emotion, Personality, and Social Behavior.

[18]  Luís Moniz Pereira,et al.  Modelling decision making with probabilistic causation , 2010, Intell. Decis. Technol..

[19]  Tran Cao Son,et al.  Domain-dependent knowledge in answer set planning , 2002, TOCL.

[20]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

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

[22]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[23]  Krzysztof R. Apt,et al.  Logic Programming and Negation: A Survey , 1994, The Journal of Logic Programming.

[24]  Han The Anh,et al.  An Implementation of Extended P-Log Using XASP , 2008, ICLP.

[25]  David Hilbert,et al.  The Foundations of Geometry , 1903, The Mathematical Gazette.

[26]  Leon Sterling,et al.  The art of Prolog (2nd ed.): advanced programming techniques , 1994 .

[27]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[28]  John F. Sowa,et al.  Knowledge representation: logical, philosophical, and computational foundations , 2000 .

[29]  Nils J. Nilsson,et al.  Shakey the Robot , 1984 .

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

[31]  Michael Gelfond,et al.  Integrating answer set programming and constraint logic programming , 2008, Annals of Mathematics and Artificial Intelligence.

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

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

[34]  Murray Shanahan,et al.  A Circumscriptive Calculus of Events , 1995, Artif. Intell..

[35]  Javier Pinto,et al.  Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus , 1998, J. Log. Comput..

[36]  Marcello Balduccini,et al.  CR-Prolog as a Specification Language for Constraint Satisfaction Problems , 2009, LPNMR.

[37]  Kurt Gödel,et al.  On Formally Undecidable Propositions of Principia Mathematica and Related Systems , 1966 .

[38]  Victor W. Marek,et al.  Generating Cellular Puzzles with Logic Programs , 2006, IC-AI.

[39]  Michael Gelfond,et al.  What are the Limitations of the Situation Calculus? , 1991, Automated Reasoning: Essays in Honor of Woody Bledsoe.

[40]  Jürgen Dix.  Classifying Semantics of Logic Programs (Extended Abstract) , 1991, LPNMR.

[41]  Ilkka Niemelä,et al.  Answer Set Programming via Mixed Integer Programming , 2012, KR.

[42]  J. McCarthy.  Situations, Actions, and Causal Laws , 1963 .

[43]  David S. Touretzky,et al.  The Mathematics of Inheritance Systems , 1984 .

[44]  Tran Cao Son,et al.  Formulating diagnostic problem solving using an action language with narratives and sensing , 2000, KR.

[45]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[46]  J. Nelson Rushton,et al.  Probabilistic reasoning with answer sets , 2004, Theory and Practice of Logic Programming.

[47]  Esra Erdem,et al.  Causal Reasoning for Planning and Coordination of Multiple Housekeeping Robots , 2011, LPNMR.

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

[49]  Marcello Balduccini,et al.  USA-Smart: Improving the Quality of Plans in Answer Set Planning , 2004, PADL.

[50]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[51]  Marcello Balduccini,et al.  Formalizing Psychological Knowledge in Answer Set Programming , 2010, KR.

[52]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[53]  Antonis C. Kakas,et al.  E-RES: Reasoning about Actions, Events and Observations , 2001, LPNMR.

[54]  Vladimir Lifschitz,et al.  Handbook of Knowledge Representation Edited Knowledge Representation and Classical Logic , 2022 .

[55]  Victor Marek.  Introduction to Mathematics of Satisfiability , 2009 .

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

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

[58]  Enrico Giunchiglia,et al.  An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.

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

[60]  A. Kakas,et al.  "Reasoning about Actions, Narratives and Ramifications" , 1997 .

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

[62]  Varol Akman,et al.  Representing the Zoo World and the Traffic World in the language of the Causal Calculator , 2004, Artif. Intell..

[63]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[64]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[65]  David E. Smith,et al.  Reasoning About Action I: A Possible Worlds Approach , 1987, Artif. Intell..

[66]  Francis Jeffry Pelletier,et al.  Representation and Inference for Natural Language: A First Course in Computational Semantics , 2005, Computational Linguistics.

[67]  Chitta Baral,et al.  Solving Puzzles Described in English by Automated Translation to Answer Set Programming and Learning How To Do That Translation , 2011, AAAI Fall Symposium: Advances in Cognitive Systems.

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

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

[70]  David Poole,et al.  The Independent Choice Logic and Beyond , 2008, Probabilistic Inductive Logic Programming.

[71]  Miroslaw Truszczynski,et al.  Answer Set Optimization , 2003, IJCAI.

[72]  Weijun Zhu,et al.  Plog: Its algorithms and applications , 2012 .

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

[74]  Maurice Bruynooghe,et al.  CP-logic: A language of causal probabilistic events and its relation to logic programming , 2009, Theory and Practice of Logic Programming.

[75]  Joohyung Lee,et al.  A New Perspective on Stable Models , 2007, IJCAI.

[76]  Enn Tyugu,et al.  The Programming System PRIZ , 1988, J. Symb. Comput..

[77]  C. Cordell Green,et al.  The Application of Theorem Proving to Question-Answering Systems , 1969, Outstanding Dissertations in the Computer Sciences.

[78]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[79]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[80]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[81]  Fangzhen Lin,et al.  State Constraints Revisited , 1994, J. Log. Comput..

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

[83]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[84]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

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

[86]  Raymond Reiter,et al.  Reasoning about time in the situation calculus , 1995, Annals of Mathematics and Artificial Intelligence.

[87]  H. Przymusinska,et al.  Weakly stratified logic programs , 1990 .

[88]  Marcello Balduccini.  An Answer Set Solver for non-Herbrand Programs: Progress Report , 2012, ICLP.

[89]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[90]  Christine Froidevaux,et al.  Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..

[91]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

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

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

[94]  Jacques Cohen,et al.  A view of the origins and development of Prolog , 1988, CACM.

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

[96]  KRZYSZTOF R. APT,et al.  A New Definition of SNDNF-Resolution , 1994, J. Log. Program..

[97]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

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

[99]  F. RICCA,et al.  Team-building with answer set programming in the Gioia-Tauro seaport , 2011, Theory and Practice of Logic Programming.

[100]  Michael Gelfond,et al.  Answer set based design of knowledge systems , 2006, Annals of Mathematics and Artificial Intelligence.

[101]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[102]  Thomas Eiter,et al.  Preferred Answer Sets for Extended Logic Programs , 1999, Artif. Intell..

[103]  Martin Gebser,et al.  Engineering an Incremental ASP Solver , 2008, ICLP.

[104]  Anil Nerode,et al.  Logic for Applications , 1997, Graduate Texts in Computer Science.

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

[106]  Michael Gelfond,et al.  Modeling Hybrid Domains Using Process Description Language , 2005, Answer Set Programming.

[107]  Ilkka Niemelä,et al.  Computing Stable Models via Reductions to Difference Logic , 2009, LPNMR.

[108]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[109]  Kenneth A. Ross.  A Prodedural Semantics for Well-Founded Negation in Logic Programs , 1992, J. Log. Program..

[110]  Yuliya Lierler,et al.  Answer Set Programming Based on Propositional Satisfiability , 2006, Journal of Automated Reasoning.

[111]  Jorge Lobo,et al.  Defeasible Specifications in Action Theories , 1997, IJCAI.

[112]  Michael Thielscher.  Action Programming Languages , 2008, Action Programming Languages.

[113]  Joohyung Lee,et al.  Stable models and circumscription , 2011, Artif. Intell..

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

[115]  Taisuke Sato,et al.  PRISM: A Language for Symbolic-Statistical Modeling , 1997, IJCAI.

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

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

[118]  Patrick Doherty,et al.  TAL: Temporal Action Logics Language Specification and Tutorial , 1998, Electron. Trans. Artif. Intell..

[119]  Enrico Pontelli,et al.  A conformant planner based on approximation: CpA(H) , 2013, TIST.

[120]  Robert A. Kowalski,et al.  Using Meta-Logic to Reconcile Reactive with Rational Agents , 1995, PAAM.

[121]  Erik T. Mueller,et al.  Commonsense Reasoning , 2006, Qualitative Representations.

[122]  Marcello Balduccini,et al.  Learning and using domain-specific heuristics in ASP solvers , 2011, AI Commun..

[123]  Raymond Reiter,et al.  Characterizing Diagnoses and Systems , 1992, Artif. Intell..

[124]  Miroslaw Truszczynski,et al.  Preferences and Nonmonotonic Reasoning , 2008, AI Mag..

[125]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[126]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[127]  Martin Gebser,et al.  Domain-Specific Heuristics in Answer Set Programming , 2013, AAAI.

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

[129]  Raymond Reiter,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2001 .

[130]  Pedro M. Domingos,et al.  Markov Logic: An Interface Layer for Artificial Intelligence , 2009, Markov Logic: An Interface Layer for Artificial Intelligence.

[131]  Marina De Vos,et al.  Automatic music composition using answer set programming , 2010, Theory and Practice of Logic Programming.

[132]  L Poole David,et al.  Artificial Intelligence: Foundations of Computational Agents , 2010 .

[133]  Robert A. Kowalski,et al.  Database Updates in the Event Calculus , 1992, J. Log. Program..

[134]  Tran Cao Son,et al.  Approximation of action theories and its application to conformant planning , 2011, Artif. Intell..

[135]  E. Sandewall.  Features and fluents (vol. 1): the representation of knowledge about dynamical systems , 1995 .

[136]  Mario Alviano,et al.  Magic Sets for disjunctive Datalog programs , 2012, Artif. Intell..

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

[138]  Anand S. Rao,et al.  Modeling Rational Agents within a BDI-Architecture , 1997, KR.

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

[140]  Michael Gelfond,et al.  Some properties of system descriptions of , 2013, J. Appl. Non Class. Logics.

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

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

[143]  J. Nelson Rushton,et al.  Combining Logical and Probabilistic Reasoning , 2006, AAAI Spring Symposium: Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering.

[144]  Donald Nute,et al.  Prolog Programming in Depth , 1988 .

[145]  Michael Gelfond,et al.  Towards Answer Set Programming with Sorts , 2013, LPNMR.

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

[147]  J. Pearl.  Causality: Models, Reasoning and Inference , 2000 .

[148]  Michael Wooldridge,et al.  Reasoning about rational agents , 2000, Intelligent robots and autonomous agents.

[149]  Michael Gelfond,et al.  Representing Null Values in Logic Programming , 1994, LFCS.

[150]  Marcello Balduccini,et al.  cr-models: An Inference Engine for CR-Prolog , 2007, LPNMR.

[151]  Mario Alviano,et al.  The HiLeX System for Semantic Information Extraction , 2012, Trans. Large Scale Data Knowl. Centered Syst..

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

[153]  Marek J. Sergot,et al.  A logic-based calculus of events , 1989, New Generation Computing.

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

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

[156]  Edwin P. D. Pednault,et al.  ADL and the State-Transition Model of Action , 1994, J. Log. Comput..

[157]  Francesco Scarcello,et al.  Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..

[158]  Ray Hilborn,et al.  The Ecological Detective , 2013 .

[159]  E. Jaynes.  Probability theory : the logic of science , 2003 .

[160]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[161]  David Poole,et al.  Representing diagnosis knowledge , 1994, Annals of Mathematics and Artificial Intelligence.

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

[163]  Robert A. Kowalski,et al.  The early years of logic programming , 1988, CACM.

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

[165]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

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

[167]  Daniela Inclezan.  An Application of ASP to the Field of Second Language Acquisition , 2013, LPNMR.

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

[169]  R. Kowalski,et al.  Linear Resolution with Selection Function , 1971 .

[170]  Thomas Stützle,et al.  Local Search Algorithms for SAT: An Empirical Evaluation , 2000, Journal of Automated Reasoning.