Computing probabilistic least common subsumers in description logics

DOI10.1007/3-540-48238-5_7MaRDI QIDQ4494324zbMATH OpenFDO

Authors Thomas Mantay, Ralf Möller, Alissa Kaplunova

Publication date 23 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48238-5_7

zbMATH Keywords

information retrieval

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Knowledge representation (68T30)

Recommendations

• Computing least common subsumers in expressive description logics
• Computing the least common subsumer w.r.t. a background terminology
• Logics in Artificial Intelligence
• Structural subsumption and least common subsumers in a description logic with existential and number restrictions
• Computing the least common subsumer in the description logic \(\mathcal{EL}\) w.r.t. terminological cycles with descriptive semantics

Cited in

(3)

• Expressive probabilistic description logics
• Computing least common subsumers in expressive description logics
• Structural subsumption and least common subsumers in a description logic with existential and number restrictions

This page was built for publication: Computing probabilistic least common subsumers in description logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4494324)