Conservative Extensions in the Lightweight Description Logic \mathcal{EL}
DOI10.1007/978-3-540-73595-3_7zbMATH Open1213.68592OpenAlexW1854293932MaRDI QIDQ3608766FDOQ3608766
Authors: Carsten Lutz, Frank Wolterinst
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
Recommendations
- Deciding inseparability and conservative extensions in the description logic
- Conservative Extensions in Horn Description Logics with Inverse Roles
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Locality and subsumption testing in \({\mathcal{EL}}\) and some of its extensions
- Tractable extensions of the description logic \({\mathcal{EL}}\) with numerical datatypes
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25)
Cited In (18)
- A logic-algebraic tool for reasoning with knowledge-based systems
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Incremental classification of description logics ontologies
- The Logical Difference Problem for Description Logic Terminologies
- Deciding inseparability and conservative extensions in the description logic
- Formal Properties of Modularisation
- Mathematical Logic for Life Science Ontologies
- Optimal fixed-premise repairs of \(\mathcal{E}\mathcal{L}\) TBoxes
- Towards a functional approach to modular ontologies using institutions
- Tractable extensions of the description logic \({\mathcal{EL}}\) with numerical datatypes
- Islands of tractability for relational constraints: towards dichotomy results for the description logic \({\mathcal{EL}}\)
- Second-order linear reasoning mechanisms for description logic \(\varepsilon L\)
- Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations
- Conservative Extensions in Horn Description Logics with Inverse Roles
- (Non-)succinctness of uniform interpolants of general terminologies in the description logic \(\mathcal{EL}\)
- Locality and subsumption testing in \({\mathcal{EL}}\) and some of its extensions
- Tractable extensions of the description logic \(\mathcal{EL}\) with numerical datatypes
- An algebraic view on p-admissible concrete domains for lightweight description logics
This page was built for publication: Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608766)