Inhaltszusammenfassung

We address the problem of finding high-level explanations for concept subsumption w.r.t. combinations of EL (resp. EL+) CBoxes. Our goal is to find explanations for concept subsumptions in such combinations of CBoxes which contain only symbols (concept names and role names) that are common to the CBoxes. For this, we use the encoding of TBox subsumption as a uniform word problem in classes of semilattices with monotone operators for EL and the ≤-interpolation property in these classes ...We address the problem of finding high-level explanations for concept subsumption w.r.t. combinations of EL (resp. EL+) CBoxes. Our goal is to find explanations for concept subsumptions in such combinations of CBoxes which contain only symbols (concept names and role names) that are common to the CBoxes. For this, we use the encoding of TBox subsumption as a uniform word problem in classes of semilattices with monotone operators for EL and the ≤-interpolation property in these classes of algebras, as well as extensions to these results in the presence of role inclusions. For computing the ≤-interpolating terms we use a translation to propositional logic and methods for computing Craig interpolants in propositional logic.» weiterlesen» einklappen

Autoren

Klassifikation

DFG Fachgebiet:
Informatik

DDC Sachgruppe:
Informatik