Structural subsumption and least common subsumers in a description logic with existential and number restrictions

DOI10.1007/S11225-005-3705-5zbMATH Open1104.03020OpenAlexW2012765436MaRDI QIDQ817690FDOQ817690

Authors: Ralf Küsters, Ralf Molitor 

Publication date: 17 March 2006

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-005-3705-5

Recommendations

• scientific article; zbMATH DE number 1500577
• Computing the least common subsumer in the description logic \(\mathcal{EL}\) w.r.t. terminological cycles with descriptive semantics
• scientific article; zbMATH DE number 1948991
• scientific article; zbMATH DE number 1487804
• Computing the least common subsumer w.r.t. a background terminology

zbMATH Keywords

complexitydescription logicsleast common subsumer

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Using automata theory for characterizing the semantics of terminological cycles
• Classic learning
• Title not available (Why is that?)
• Title not available (Why is that?)
• The learnability of description logics with equality constraints
• What's in an attribute? Consequences for the least common subsumer
• Matching in description logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automated Reasoning
• Logics in Artificial Intelligence
• Computing the least common subsumer in the description logic \(\mathcal{EL}\) w.r.t. terminological cycles with descriptive semantics
• Non-standard inferences in description logics

Cited In (7)

• Computing the least common subsumer in the description logic \(\mathcal{EL}\) w.r.t. terminological cycles with descriptive semantics
• Title not available (Why is that?)
• What's in an attribute? Consequences for the least common subsumer
• Concept Lattices
• Title not available (Why is that?)
• A compact representation for least common subsumers in the description logic \({\mathcal {ALE}}\)
• Graph-Theoretic Concepts in Computer Science

Uses Software

• FaCT++
• Sonic

This page was built for publication: Structural subsumption and least common subsumers in a description logic with existential and number restrictions

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