Computing least common subsumers in expressive description logics

DOI10.1007/3-540-46695-9_19MaRDI QIDQ4501598zbMATH OpenFDO

Authors Thomas Mantay

Publication date 16 November 2000

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

Full work available at URL https://doi.org/10.1007/3-540-46695-9_19

zbMATH Keywords

computing least common subsumersdescription logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic in artificial intelligence (68T27)

Recommendations

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

Cited in

(8)

• Computing the least common subsumer w.r.t. a background terminology
• Building and structuring description logic knowledge bases using least common subsumers and concept analysis
• A compact representation for least common subsumers in the description logic \({\mathcal {ALE}}\)
• Computing probabilistic least common subsumers in description logics
• Logics in Artificial Intelligence
• Computing the least common subsumer in the description logic \(\mathcal{EL}\) w.r.t. terminological cycles with descriptive semantics
• Concept Lattices
• Structural subsumption and least common subsumers in a description logic with existential and number restrictions

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

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