Subsumption Algorithms for Concept Languages

@inproceedings{Hollunder1990SubsumptionAF,
  title={Subsumption Algorithms for Concept Languages},
  author={Bernhard Hollunder and Werner Nutt},
  year={1990}
}
We investigate t he 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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 64 CITATIONS, ESTIMATED 28% COVERAGE

228 Citations

0102030'90'96'03'10'17
Citations per Year
Semantic Scholar estimates that this publication has 228 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Smullyan. First-Order Logic

  • R M.
  • 1968

Similar Papers

Loading similar papers…