Subsumption Algorithms for Concept Description Languages

Abstract

We investigate subsumption algorithms for logic-based knowledge representation languages of the kl-one family. We deene an attribu-tive concept description language that contains the logical connectives conjunction, disjunction, and negation, as well as role quantiication, number restrictions and role intersection. We describe a rule based calculus to decide subsumption in this language, that closely resembles the tableaux calculus of rst order predicate logic. Furthermore, we give polynomial space algorithms for certain sublanguages.

Extracted Key Phrases

Statistics

02040'92'95'98'01'04'07'10'13'16
Citations per Year

231 Citations

Semantic Scholar estimates that this publication has 231 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Hollunder1990SubsumptionAF, title={Subsumption Algorithms for Concept Description Languages}, author={Bernhard Hollunder and Werner Nutt and Manfred Schmidt-Schau\ss}, booktitle={ECAI}, year={1990} }