Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
From MaRDI portal
Publication:2999101
DOI10.3233/978-1-60750-606-5-29zbMath1211.68410OpenAlexW1516970863MaRDI QIDQ2999101
Barış Sertkaya, Rafael Peñaloza
Publication date: 11 May 2011
Full work available at URL: https://doi.org/10.3233/978-1-60750-606-5-29
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Related Items (6)
The Bayesian ontology language \(\mathcal {BEL}\) ⋮ Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing ⋮ Understanding the complexity of axiom pinpointing in lightweight description logics ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Efficient Reasoning for Inconsistent Horn Formulae ⋮ The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
This page was built for publication: Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
