Deduction in Concept Languages: from Subsumption to Instance Checking
From MaRDI portal
Recommendations
Cited in
(17)- DL-LINK: A CONCEPTUAL CLUSTERING ALGORITHM FOR INDEXING DESCRIPTION LOGICS KNOWLEDGE BASES
- Unification of concept terms in description logics
- Linking Data to Ontologies
- A sequent calculus for reasoning in four-valued description logics
- Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures
- Combining interval-based temporal reasoning with general TBoxes
- Data complexity of query answering in expressive description logics via tableaux
- scientific article; zbMATH DE number 140374 (Why is no real title available?)
- scientific article; zbMATH DE number 4166932 (Why is no real title available?)
- Adding threshold concepts to the description logic \(\mathcal{EL}\)
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Ontologies and Databases: The DL-Lite Approach
- An epistemic operator for description logics
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Consistency checking reduced to satisfiability of concepts in terminological systems
- Preference-based inconsistency-tolerant query answering under existential rules
- A refined architecture for terminological systems: Terminology = Schema + Views
This page was built for publication: Deduction in Concept Languages: from Subsumption to Instance Checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305351)
