After a short analysis of the requirements that a knowledge representation language must satisfy, we introduce Description Logics, Modal Logics, and Nonmonotonic Logics as formalisms for representing, respectively, terminological knowledge, time-dependent and subjective knowledge, and incomplete knowledge. At the end of each section, we briefly comment on the connection to Logic Programming. Introduction Let us start with asking under which conditions one may rightfully claim to have represented knowledge about an application domain, and not just stored data occurring in this domain. 1 One aspect of the requirements on knowledge representation formalisms that can be derived from this consideration is very well satisfied by logical formalisms. We shall see, however, that some other aspects are not treated satisfactorily, at least not by classical firstorder predicate logic. Logic Programming languages, as indicated by their name, are programming languages, and thus not necessarily ap...
|
892
|
Temporal and modal logic
– Emerson
- 1990
|
|
814
|
The temporal logic of programs
– Pnueli
- 1977
|
|
773
|
Negation as failure
– Clark
- 1978
|
|
567
|
Classical Negation in Logic Programs and Disjunctive Databases
– Gelfond, Lifschitz
|
|
567
|
An Introduction to Modal Logic
– Hughes, Cresswell
- 1968
|
|
515
|
Classification in the KL-One Knowledge Representation System
– Schmolze, Lipkis
- 1983
|
|
504
|
Modal logic: an introduction
– Chellas
- 1980
|
|
412
|
Nonmonotonic reasoning, preferential models and cumulative logics
– Kraus, Lehmann, et al.
- 1990
|
|
305
|
CLASSIC: A structural data model for objects
– Borgida, Brachman, et al.
- 1989
|
|
292
|
Logic Programs with classical negation
– Gelfond, Lifschitz
- 1990
|
|
288
|
A guide to completeness and complexity for modal logics of knowledge and belief
– Halpern, Moses
- 1992
|
|
229
|
A scheme for integrating concrete domains into concept languages
– Baader, Hanschke
- 1991
|
|
207
|
The complexity of concept languages
– Donini, Lenzerini, et al.
- 1991
|
|
205
|
Using an expressive description logic: FaCT or fiction
– Horrocks
- 1998
|
|
203
|
Patel-Schneider P F, Resnick L A, Living with CLASSIC: When and how to use a KL-ONE-like language
– Brachman, McGuinness
- 1991
|
|
202
|
Logic programming and negation: a survey
– Apt, Bol
- 1994
|
|
193
|
Reasoning in description logics
– Donini, Lenzerini, et al.
- 1996
|
|
188
|
Logic Programming and Knowledge Representation
– BARAL, GELFOND
- 1994
|
|
167
|
Concept logics
– Baader, Burckert, et al.
- 1990
|
|
166
|
Modal languages and bounded fragments of predicate logic
– Andréka, Benthem, et al.
- 1998
|
|
158
|
Decidable reasoning in terminological knowledge representation systems
– Buchheit, Donini, et al.
- 1993
|
|
158
|
Many-valued modal logics
– Fitting
- 1992
|
|
158
|
Theoretical Foundations for Non-monotonic Reasoning in Expert Systems." Appearing in
– Gabbay
- 1985
|
|
155
|
LaSSIE: A KnowledgeBased Software Information System. Automated Software Design. Edited by M.R. Lowry and R.D
– Devanbu, Ballard
- 1991
|
|
151
|
A semantics and complete algorithm for subsumption in the CLASSIC description logic
– Borgida, Patel-Schneider
- 1994
|
|
126
|
On the relationship between default and autoepistemic logic
– Konolige
- 1988
|
|
125
|
General Patterns in Nonmonotonic Reasoning
– Makinson
- 1994
|
|
123
|
Nonmonotonic Reasoning: Logical Foundations of Commonsense
– Brewka
- 1991
|
|
118
|
An empirical analysis of optimization techniques for terminological representation systems
– Baader, Hollunder, et al.
- 1992
|
|
110
|
On the relative expressiveness of description logics and predicate logics
– Borgida
- 1996
|
|
107
|
General theory of cumulative inference
– Makinson
- 1989
|
|
105
|
Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles
– Baader
- 1991
|
|
103
|
Expressiveness and tractability in knowledge representation and reasoning
– Levesque, Brachman
- 1987
|
|
101
|
The loom knowledge representation language
– MacGregor, Bates
- 1987
|
|
90
|
Optimising Tableaux Decision Procedures for Description Logics
– Horrocks
- 1997
|
|
88
|
A terminological knowledge representation system with complete inference algorithms
– Baader, Hollunder
- 1991
|
|
87
|
CARIN: A representation language combining Horn rules and description logics
– Levy, Rousset
- 1996
|
|
84
|
On the restraining power of guards
– Grädel
- 1999
|
|
82
|
The stable semantics for logic programs
– Gelfond, Lifschitz
- 1988
|
|
80
|
Subsumption algorithms for concept description languages
– Hollunder, Nutt, et al.
- 1990
|
|
79
|
Nonmonotonic Reasoning
– Antoniou
- 1997
|
|
76
|
Boosting the correspondence between descriptionlogics and propositional dynamic logics
– Giacomo, Lenzerini
|
|
71
|
Semantics of Logic Programs: Their Intuitions and Formal Properties
– Dix
- 1995
|
|
71
|
Tbox and Abox reasoning in expressive description logics
– Giacomo, Lenzerini
- 1996
|
|
69
|
Modal logic with names
– Gargov, Goranko
- 1993
|
|
66
|
Qualifying number restrictions in concept languages
– Hollunder, Baader
- 1991
|
|
65
|
The logic of frames
– Hayes
- 1979
|
|
62
|
1991], Tractable concept languages
– Donini, Lenzerini, et al.
|
|
62
|
Adding epistemic operators to concept languages
– Donini, Lenzerini, et al.
- 1992
|
|
62
|
Deduction in concept languages: From subsumption to instance checking
– Donini, Lenzerini, et al.
- 1994
|
|
