Science of Computer Programming
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handbook of automated reasoning
NCI Thesaurus: A semantic model integrating cancer-related clinical and molecular information
Journal of Biomedical Informatics
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Computing least common subsumers in description logics with existential restrictions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A logical framework for modularity of ontologies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conservative extensions in expressive description logics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The Logical Difference Problem for Description Logic Terminologies
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Formal Properties of Modularisation
Modular Ontologies
Semantic Modularity and Module Extraction in Description Logics
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Mathematical Logic for Life Science Ontologies
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
A logical semantics for description logic programs
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Completeness guarantees for incomplete reasoners
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
MORe: modular combination of OWL reasoners for ontology classification
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Concept-Based semantic difference in expressive description logics
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Hi-index | 0.00 |
We bring together two recent trends in description logic (DL): lightweight DLsin which the subsumption problem is tractable and conservative extensionsas a central tool for formalizing notions of ontology design such as refinement and modularity. Our aim is to investigate conservative extensions as an automated reasoning problem for the basic tractable DL $\mathcal{EL}$. The main result is that deciding (deductive) conservative extensions is ExpTime-complete, thus more difficult than subsumption in $\mathcal{EL}$, but not more difficult than subsumption in expressive DLs. We also show that if conservative extensions are defined model-theoretically, the associated decision problem for $\mathcal{EL}$ is undecidable.