Computing the hierarchy of conjunctions of concept names and their negations in a Description Logic knowledge base using Formal Concept Analysis (ICFCA 2006)

Barış SertkayaBarış Sertkaya

Download

Barış Sertkaya
Computing the hierarchy of conjunctions of concept names and their negations in a Description Logic knowledge base using Formal Concept Analysis (ICFCA 2006)
In Bernhard Ganter and Leonard Kwuida, eds., Contributions to ICFCA 2006, 73-86, 2006. Verlag Allgemeine Wissenschaft

Details
Bibtex

KurzfassungAbstract
In a series of previous work, we have presented how attribute exploration can be used in the bottom-up construction of DL knowledge bases to compute a concept lattice that is isomorphic to the subsumption hierarchy of all conjunctions of concept names occurring in a knowledge base, and the negations of these concept names. This work is a continuation in the line of the previous work, that makes a step towards more efficient computation of the mentioned hierarchy. Its specific accomplishment is reducing the number of questions asked to the expert and the number of objects produced during the computation of this hierarchy, thus speeding up the computation. Despite its simple nature, the approach speeds up the computation of this hierarchy drastically.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ SertkayaICFCA06,
  address = {Dresden, Germany},
  author = {Bar\i{}\c{s} {Sertkaya}},
  booktitle = {Contributions to ICFCA 2006},
  editor = {Bernhard {Ganter} and Leonard {Kwuida}},
  pages = {73--86},
  publisher = {Verlag Allgemeine Wissenschaft},
  title = {Computing the hierarchy of conjunctions of concept names and their negations in a Description Logic knowledge base using Formal Concept Analysis ({ICFCA 2006})},
  year = {2006},
}