Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$

DOI10.1007/978-3-540-73595-3_7zbMath1213.68592OpenAlexW1854293932MaRDI QIDQ3608766

Frank Wolterinst, Carsten Lutz

Publication date: 6 March 2009

Published in: Automated Deduction – CADE-21 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73595-3_7

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (10)

Optimal fixed-premise repairs of \(\mathcal{E}\mathcal{L}\) TBoxes ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ The Logical Difference Problem for Description Logic Terminologies ⋮ A logic-algebraic tool for reasoning with knowledge-based systems ⋮ Incremental classification of description logics ontologies ⋮ Towards a functional approach to modular ontologies using institutions ⋮ (Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\) ⋮ Formal Properties of Modularisation ⋮ Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations ⋮ Mathematical Logic for Life Science Ontologies

This page was built for publication: Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$