Deduction in Concept Languages: from Subsumption to Instance Checking
From MaRDI portal
Publication:4305351
DOI10.1093/logcom/4.4.423zbMath0809.68109OpenAlexW2007877603MaRDI QIDQ4305351
Andrea Schaerf, Daniele Nardi, Maurizio Lenzerini, Francesco 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)
Related Items (15)
Consistency checking reduced to satisfiability of concepts in terminological systems ⋮ A refined architecture for terminological systems: Terminology = Schema + Views ⋮ An epistemic operator for description logics ⋮ Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures ⋮ Adding Threshold Concepts to the Description Logic $\mathcal{EL}$ ⋮ Inconsistency-Tolerant Querying of Description Logic Knowledge Bases ⋮ A sequent calculus for reasoning in four-valued Description Logics ⋮ Tractable reasoning and efficient query answering in description logics: The DL-Lite family ⋮ Data complexity of query answering in expressive description logics via tableaux ⋮ DL-LINK: A CONCEPTUAL CLUSTERING ALGORITHM FOR INDEXING DESCRIPTION LOGICS KNOWLEDGE BASES ⋮ Unification of concept terms in description logics ⋮ Linking Data to Ontologies ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ Preference-based inconsistency-tolerant query answering under existential rules ⋮ Combining interval-based temporal reasoning with general TBoxes
This page was built for publication: Deduction in Concept Languages: from Subsumption to Instance Checking
