Deduction in Concept Languages: from Subsumption to Instance Checking
From MaRDI portal
Publication:4305351
DOI10.1093/LOGCOM/4.4.423zbMATH Open0809.68109OpenAlexW2007877603MaRDI QIDQ4305351FDOQ4305351
Andrea Schaerf, Daniele Nardi, Maurizio Lenzerini, F. M. Donini
Publication date: 17 October 1994
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/50a8edba60b0e8d083f7fdb945385a9ebb681b8d
Knowledge representation (68T30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (16)
- DL-LINK: A CONCEPTUAL CLUSTERING ALGORITHM FOR INDEXING DESCRIPTION LOGICS KNOWLEDGE BASES
- Unification of concept terms in description logics
- Linking Data to Ontologies
- 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
- Title not available (Why is that?)
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Ontologies and Databases: The DL-Lite Approach
- A sequent calculus for reasoning in four-valued Description Logics
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- An epistemic operator for description logics
- Consistency checking reduced to satisfiability of concepts in terminological systems
- Adding Threshold Concepts to the Description Logic $\mathcal{EL}$
- Preference-based inconsistency-tolerant query answering under existential rules
- A refined architecture for terminological systems: Terminology = Schema + Views
Recommendations
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)
