Abstract
We present a method to compute uniform interpolants with fixpoints for ontologies specified in the description logic ALC. The aim of uniform interpolation is to reformulate an ontology such that it only uses a specified set of symbols, while preserving consequences that involve these symbols. It is known that in ALC uniform interpolants cannot always be finitely represented. Our method computes uniform interpolants for the target language ALCμ, which is ALC enriched with fixpoint operators, and always computes a finite representation. If the result does not involve fixpoint operators, it is the uniform interpolant in ALC. The method focuses on eliminating concept symbols and combines resolution-based reasoning with an approach known from the area of second-order quantifier elimination to introduce fixpoint operators when needed. If fixpoint operators are not desired, it is possible to approximate the interpolant. © 2013 Springer-Verlag.
Original language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. |
Publisher | Springer Nature |
Pages | 87-102 |
Number of pages | 15 |
Volume | 8152 |
ISBN (Print) | 9783642408847 |
DOIs | |
Publication status | Published - 2013 |
Event | 9th International Symposium on Frontiers of Combining Systems, FroCoS 2013 - Nancy Duration: 1 Jul 2013 → … http://www.cs.man.ac.uk/ schmidt/publications/KoopmannSchmidt13a.html |
Publication series
Name | Lecture Notes in Artificial Intelligence |
---|
Conference
Conference | 9th International Symposium on Frontiers of Combining Systems, FroCoS 2013 |
---|---|
City | Nancy |
Period | 1/07/13 → … |
Internet address |