Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- 1 Logic-Based Approach to Agent Design
- 2 Answer Set Prolog (ASP)
- 3 Roots of Answer Set Prolog
- 4 Creating a Knowledge Base
- 5 Representing Defaults
- 6 The Answer-Set Programming Paradigm
- 7 Algorithms for Computing Answer Sets
- 8 Modeling Dynamic Domains
- 9 Planning Agents
- 10 Diagnostic Agents
- 11 Probabilistic Reasoning
- 12 The Prolog Programming Language
- Appendix A ASP Solver Quick-Start
- Appendix B Aspide
- Appendix C Introduction to SPARC
- Appendix D Code
- Bibliography
- Index
3 - Roots of Answer Set Prolog
Published online by Cambridge University Press: 05 July 2014
- Frontmatter
- Dedication
- Contents
- Preface
- 1 Logic-Based Approach to Agent Design
- 2 Answer Set Prolog (ASP)
- 3 Roots of Answer Set Prolog
- 4 Creating a Knowledge Base
- 5 Representing Defaults
- 6 The Answer-Set Programming Paradigm
- 7 Algorithms for Computing Answer Sets
- 8 Modeling Dynamic Domains
- 9 Planning Agents
- 10 Diagnostic Agents
- 11 Probabilistic Reasoning
- 12 The Prolog Programming Language
- Appendix A ASP Solver Quick-Start
- Appendix B Aspide
- Appendix C Introduction to SPARC
- Appendix D Code
- Bibliography
- Index
Summary
Answer Set Prolog is a comparatively new knowledge representation (KR) language with roots in older nonmonotonic logics and the logic programming language Prolog. Early proponents of the logical approach to artificial intelligence believed that the classical logical formalism called first-order logic would serve as the basis for the application of the axiomatic method to the development of intelligent agents. In this chapter we briefly describe some important developments that forced them to question this belief and to work instead on the development of nonclassical knowledge representation languages including ASP. To make the chapter easier for people not familiar with mathematical logic, we give a very short introduction to one of its basic logical tools — first-order logic.
First-Order Logic (FOL)
First-order logic is a formal logical system that consists of a formal language, an entailment or consequence relation for this language, and a collection of inference rules that can be used to obtain these consequences. The language of FOL is parametrized with respect to a signature Σ. The notions of term and atom over Σ are the same as those defined in Section 2.1. The statements of FOL (called FOL formulas) are built from atoms using boolean logical connectives and quantifiers ∀ (for all) and ∃ (there exists). Atoms are formulas. If A and B are formulas and X is a variable, then (A ∧ B), (A ∨ B), (A ⊃ B), ¬A, ∀ X A, ∃X A are formulas.
- Type
- Chapter
- Information
- Knowledge Representation, Reasoning, and the Design of Intelligent AgentsThe Answer-Set Programming Approach, pp. 40 - 60Publisher: Cambridge University PressPrint publication year: 2014