(Enter summary)
Abstract: We investigate the subsumption problem in logic-based knowledge representation
languages of the kl-one family and give decision procedures.
All our languages contain as a kernel the logical connectives
conjunction, disjunction, and negation for concepts, as well as role
quantification. The algorithms are rule-based and can be understood
as variants of tableaux calculus with a special control strategy.
In the first part of the paper, we add number restrictions and conjunction
of roles to the... (Update)
Cited by: More
Resolution-Based Methods for Modal Logics - De Nivelle, Schmidt, Hustadt (2000)
(Correct)
A Description Logic with Concrete Domains for a Metaclass .. - Bermudez, Illarramendi (2000)
(Correct)
Using Description Logic in Object-Oriented Software Development - Van Der Straeten
(Correct)
Similar documents (at the sentence level):
39.6%: Subsumption Algorithms for Concept Description Languages - Hollunder, Nutt.. (1990)
(Correct)
Active bibliography (related documents): More All
0.5: Algebraic Terminological Representation - Schmidt (1991)
(Correct)
0.3: Feature Constraint Logics for Unification Grammars - Smolka (1992)
(Correct)
0.2: What is Hybrid in Hybrid Representation and Reasoning Systems? - Nebel (1989)
(Correct)
Similar documents based on text: More All
0.2: Task Acquisition with a Description Logic Reasoner - Buchheit, Bürckert.. (1995)
(Correct)
0.1: A SAT-Based Decision Procedure for ALC - Giunchiglia, Sebastiani (1996)
(Correct)
0.1: A SAT-based decision procedure for ALC - Giunchiglia, Sebastiani (1996)
(Correct)
Related documents from co-citation: More All
23: Decidable reasoning in terminological knowledge representation systems
- Buchheit, Donini et al. - 1993
21: Attributive concept descriptions with complements (context) - Schmidt-Schauss, Smolka - 1991
20: A correspondence theory for terminological logics: Preliminary report
- Schild - 1991
BibTeX entry: (Update)
Hollunder,B., Nutt,W., 1990,"Subsumption algorithms for concept languages", DFKI-Res.Rep. RR90 -04 http://citeseer.ist.psu.edu/article/hollunder90subsumption.html More
@techreport{ hollunder90subsumption,
author = "Bernhard Hollunder and Werner Nutt",
title = "Subsumption Algorithms for Concept Languages",
number = "RR-90-04",
address = "Deutsches Forschungszentrum f{\"u}r K{\"u}nstliche Intelligenz GmbH\\Erwin-Schr{\"o}dinger Stra{ss}e\\Postfach 2080\\67608 Kaiserslautern\\Germany",
pages = "34",
year = "1990",
url = "citeseer.ist.psu.edu/article/hollunder90subsumption.html" }
Citations (may not include all citations):
480
An Overview of the KL-ONE Knowledge Representation System (context) - Brachman, Schmolze - 1985 DBLP
243
An Introduction to Unification-Based Approaches to Grammar (context) - Shieber - 1986
235
First-Order Logic (context) - Smullyan - 1968
231
CLASSIC: A Structural Data Model for Objects
- Borgida, Brachmann et al. - 1989 ACM DBLP
193
Reasoning and Revision in Hybrid Representation Systems (context) - Nebel - 1989 ACM
118
The tractability of subsumption in frame based description l.. (context) - Brachmann, Levesque - 1984
94
Expressiveness and tractability in knowledge representation .. (context) - Levesque, Brachman - 1987 DBLP
81
Combinatorial Algorithms (context) - Nijenhuis, Wilf - 1975 ACM
74
The Loom Knowledge Representation Language (context) - MacGregor, Bates - 1987
72
Computational complexity of terminological reasoning in BACK
- Nebel - 1988 ACM DBLP
69
Subsumption in KL-ONE is undecidable (context) - Schmidt-Schauss - 1989 ACM DBLP
65
An essential hybrid reasoning system: knowledge and symbol l.. (context) - Brachman, Gilbert et al. - 1985
62
A Feature Logic with Subsorts
- Smolka - 1988
45
Undecidability of subsumption in NIKL (context) - Patel-Schneider - 1989 DBLP
41
The restricted language architecture of a hybrid representat.. (context) - Vilain - 1985 DBLP
39
Small can be beautiful in knowledge representation (context) - Patel-Schneider - 1984
26
Recent developments in NIKL (context) - Kaczmarek, Bates et al. - 1986 DBLP
17
Hybrid reasoning in BACK
- Nebel, von Luck - 1988 DBLP
15
Attributive Concept Descriptions with Unions and Complements (context) - Schmidt-Schauss, Smolka - 1988
3
Subsumption Algorithms for Some Attributive Concept Descript.. (context) - Hollunder - 1988
1
Undecidability of U (context) - Schild - 1988
1
A Source of Complexity in Terminological Reasoning (context) - Donini, Hollunder et al. - 2080
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dfki.de/~tacos/TACOS-Publications.html): More
The Complexity of Existential Quantification in.. - Donini, Hollunder.. (1992)
(Correct)
Combination Problems for Commutative/Monoidal Theories or How.. - Baader, Nutt (1996)
(Correct)
Tractable Reasoning in a Universal Description Logic (Extended.. - Schild (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC