The Description Logic Handbook
The Description Logic Handbook
Forgetting in Managing Rules and Ontologies
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Uniform Interpolation by Resolution in Modal Logic
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Forgetting and uniform interpolation in large-scale description logic terminologies
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Concept and Role Forgetting in ${\mathcal {ALC}}$ Ontologies
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Uniform Interpolation for $\mathcal{ALC}$ Revisited
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
Tableau-based Forgetting in ALC Ontologies
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
The logical difference for the lightweight description logic EL
Journal of Artificial Intelligence Research
On the (non-)succinctness of uniform interpolation in general EL terminologies
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Hitting the sweetspot: economic rewriting of knowledge bases
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Reasoning over ontologies with hidden content: the import-by-query approach
Journal of Artificial Intelligence Research
Model-theoretic inseparability and modularity of description logic ontologies
Artificial Intelligence
Beth definability in expressive description logics
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform interpolants and their existence in terms of bisimulations, tight complexity bounds for deciding the existence of uniform interpolants, an approach to computing interpolants when they exist, and tight bounds on their size. We use a mix of model-theoretic and automata-theoretic methods that, as a by-product, also provides characterizations of and decision procedures for conservative extensions.