Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics

DOI10.3233/978-1-60750-606-5-29MaRDI QIDQ2999101zbMATH OpenOpenAlexFDO

Authors Rafael Peñaloza, Barış Sertkaya

Publication date 11 May 2011

Full work available at URL https://doi.org/10.3233/978-1-60750-606-5-29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• Understanding the complexity of axiom pinpointing in lightweight description logics
• Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
• The complexity of finite model reasoning in description logics
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics
• LTL over description logic axioms
• The complexity of finite model reasoning in description logics.

Cited in

(7)

• Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
• Understanding the complexity of axiom pinpointing in lightweight description logics
• Efficient reasoning for inconsistent Horn formulae
• The Bayesian ontology language \(\mathcal {BEL}\)
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999101)