. Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableaulike algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of programs (such as propositional dynamic logic), for which tableau procedures have been quite successful. Nevertheless, due to different underlying intuitions and applications, most description logics differ significantly from run-of-the-mill modal and program logics. Consequently, the research on tableau algorithms in description logics led to new techniques and results, which are, however, also of interest for modal logicians. In this article, we will focus on three features that play an impo...
|
567
|
A Framework for Representing Knowledge
– Minsky
- 1975
|
|
515
|
Classification in the KL-One Knowledge Representation System
– Schmolze, Lipkis
- 1983
|
|
240
|
Practical reasoning for expressive description logics
– Horrocks, Sattler, et al.
- 1999
|
|
229
|
A scheme for integrating concrete domains into concept languages
– Baader, Hanschke
- 1991
|
|
226
|
Relational between nondeterministic and deterministic tape complexity
– Savitch
- 1970
|
|
212
|
A correspondence theory for terminological logics
– Schild
- 1991
|
|
207
|
The complexity of concept languages
– Donini, Lenzerini, et al.
- 1991
|
|
205
|
Using an expressive description logic: FaCT or fiction
– Horrocks
- 1998
|
|
189
|
Reasoning and Revision in Hybrid Representation Systems. Lecture Notes in
– Nebel
- 1990
|
|
158
|
Decidable reasoning in terminological knowledge representation systems
– Buchheit, Donini, et al.
- 1993
|
|
158
|
The evolving technology of classification-based knowledge representation systems
– MacGregor
- 1991
|
|
151
|
A semantics and complete algorithm for subsumption in the CLASSIC description logic
– Borgida, Patel-Schneider
- 1994
|
|
150
|
Smolka: Attribute concept descriptions with complements
– Schmidt-Schau, G
- 1991
|
|
148
|
The tractability of subsumption in framebased description languages
– Brachman, Levesque
- 1984
|
|
123
|
Terminological reasoning is inherently intractable
– Nebel
- 1990
|
|
118
|
An empirical analysis of optimization techniques for terminological representation systems
– Baader, Hollunder, et al.
- 1992
|
|
115
|
The FaCT system
– Horrocks
- 1998
|
|
105
|
Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles
– Baader
- 1991
|
|
93
|
Terminological cycles: semantics and computational properties
– Nebel
- 1990
|
|
89
|
A description logic with transitive and inverse roles and role hierarchies
– Horrocks, Sattler
- 1999
|
|
88
|
A terminological knowledge representation system with complete inference algorithms
– Baader, Hollunder
- 1991
|
|
80
|
Subsumption algorithms for concept description languages
– Hollunder, Nutt, et al.
- 1990
|
|
76
|
Boosting the correspondence between descriptionlogics and propositional dynamic logics
– Giacomo, Lenzerini
|
|
71
|
Tbox and Abox reasoning in expressive description logics
– Giacomo, Lenzerini
- 1996
|
|
66
|
Qualifying number restrictions in concept languages
– Hollunder, Baader
- 1991
|
|
62
|
1991], Tractable concept languages
– Donini, Lenzerini, et al.
|
|
59
|
Subsumption algorithms for concept languages
– Hollunder, Nutt
- 1990
|
|
57
|
Decidability of Class-Based Knowledge Representation Formalisms
– Giacomo
- 1995
|
|
50
|
B.: Cardinality restrictions on concepts
– Baader, Buchheit, et al.
- 1996
|
|
47
|
Implementing and testing expressive description logics: Preliminary report
– Bresciani, Franconi, et al.
- 1995
|
|
46
|
The CLASSIC knowledge representation system: Guiding principles and implementation rational
– Patel-Schneider, McGuiness, et al.
- 1991
|
|
45
|
The complexity of existential quantification in concept languages
– Donini, Hollunder, et al.
- 1992
|
|
44
|
Optimizing description logic subsumption
– Horrocks, Patel-Schneider
- 1999
|
|
44
|
Subsumption in KL-ONE is undecidable
– Schmidt-Schau
- 1989
|
|
43
|
A concept language extended with different kinds of transitive roles
– Sattler
- 1996
|
|
41
|
Reducing" CLASSIC to practice: Knowledge representation meets reality
– Brachman
- 1992
|
|
37
|
Concept Language with Number Restrictions and Fixpoints, and its Relationship with the Mu-calculus
– Giacomo, Lenzerini
|
|
34
|
On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations
– Baader, Bürckert, et al.
- 1993
|
|
33
|
Terminological cycles and the propositional -calculus
– Schild
- 1994
|
|
30
|
Hybrid inferences in KL-ONE-based knowledge representation systems
– Hollunder
- 1990
|
|
25
|
1999], ‘Expressive number restrictions in description logics
– Baader, Sattler
|
|
23
|
Complexity of terminological reasoning revisited
– Lutz
- 1999
|
|
22
|
Specifying role interaction in concept languages
– Hanschke
- 1992
|
|
21
|
The back system - an overview
– Peltason
- 1991
|
|
18
|
Tableaux and algorithms for propositional dynamic logic with converse
– Giacomo, Massacci
- 1996
|
|
11
|
A PSpace algorithm for graded modal logic
– Tobies
- 1999
|
|
10
|
Consistency checking reduced to satisfiability of concepts in terminological systems
– Hollunder
|
|
10
|
The complexity of propositional tense logics
– Spaan
- 1993
|
|
4
|
der Hoek and Maarten de Rijke. Counting objects
– Van
- 1995
|
|
1
|
concepts: A theory and simulation of some basic capabilities
– Word
- 1967
|
|
