On the complexity of the instance checking problem in concept languages with existential quantification

  • Andrea Schaerf
  • Published 1993 in Journal of Intelligent Information Systems


Most of the work regarding complexity results for concept languages consider subsumption as the prototypical inference. However, when concept languages are used for building knowledge bases including assertions on individuals, the basic deductive service of the knowledge base is the so-called instance checking, which is the problem of checking if an… (More)
DOI: 10.1007/BF00962071


1 Figure or Table