Computing the least common subsumer w.r.t. a background terminology
From MaRDI portal
Publication:2372193
DOI10.1016/j.jal.2006.03.002zbMath1122.68117OpenAlexW1990159861MaRDI QIDQ2372193
Anni-Yasmin Turhan, Franz Baader, Barış Sertkaya
Publication date: 25 July 2007
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2006.03.002
Related Items
Natural language directed inference from ontologies, Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\), Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention, Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures, DL-LINK: A CONCEPTUAL CLUSTERING ALGORITHM FOR INDEXING DESCRIPTION LOGICS KNOWLEDGE BASES, Unification in the Description Logic $\mathcal{EL}$, The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
Uses Software
Cites Work
- Classic learning
- Attributive concept descriptions with complements
- The complexity of existential quantification in concept languages.
- Finding all closed sets: A general approach
- The KL-ONE family
- Attribute exploration with background knowledge
- Terminological reasoning is inherently intractable
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Begriffliche Wissensverarbeitung
- Practical reasoning for very expressive description logics
- Automated Reasoning
- Logics in Artificial Intelligence
- Concept Lattices
- Non-standard inferences in description logics
- An overview of tableau algorithms for description logics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
