On the complexity of the instance checking problem in concept languages with existential quantification
- 1 September 1993
- journal article
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 2 (3) , 265-278
- https://doi.org/10.1007/bf00962071
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The complexity of existential quantification in concept languagesArtificial Intelligence, 1992
- The BACK system—an overviewACM SIGART Bulletin, 1991
- The CLASSIC knowledge representation systemACM SIGART Bulletin, 1991
- Inside the LOOM description classifierACM SIGART Bulletin, 1991
- Attributive concept descriptions with complementsArtificial Intelligence, 1991
- TERMINOLOGICAL CYCLESPublished by Elsevier ,1991
- Terminological reasoning is inherently intractableArtificial Intelligence, 1990
- Computational complexity of terminological reasoning in BACKArtificial Intelligence, 1988
- Expressiveness and tractability in knowledge representation and reasoning1Computational Intelligence, 1987