TY - GEN
T1 - Count and forget
T2 - 7th International Joint Conference on Automated Reasoning, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014
AU - Koopmann, Patrick
AU - Schmidt, Renate A.
PY - 2014
Y1 - 2014
N2 - We propose a method for forgetting concept symbols and non-transitive roles symbols of-ontologies, or for computing uniform interpolants in. Uniform interpolants restrict the symbols occuring in an ontology to a specified set, while preserving all logical entailments that can be expressed using this set in the description logic under consideration. Uniform interpolation has applications in ontology reuse, information hiding and ontology analysis, but so far no method for computing uniform interpolants for expressive description logics with number restrictions has been developed. Our results are not only interesting because they allow to compute uniform interpolants of ontologies using a more expressive language. Using number restrictions also allows to preserve more information in uniform interpolants of ontologies in less complex logics, such as or. The presented method computes uniform interpolants on the basis of a new resolution calculus for. The output of our method is expressed using, which is extended with fixpoint operators, to always enable a finite representation of the uniform interpolant. If the uniform interpolant uses fixpoint operators, it can be represented in without fixpoints operators using additional concept symbols or by approximation. © 2014 Springer International Publishing Switzerland.
AB - We propose a method for forgetting concept symbols and non-transitive roles symbols of-ontologies, or for computing uniform interpolants in. Uniform interpolants restrict the symbols occuring in an ontology to a specified set, while preserving all logical entailments that can be expressed using this set in the description logic under consideration. Uniform interpolation has applications in ontology reuse, information hiding and ontology analysis, but so far no method for computing uniform interpolants for expressive description logics with number restrictions has been developed. Our results are not only interesting because they allow to compute uniform interpolants of ontologies using a more expressive language. Using number restrictions also allows to preserve more information in uniform interpolants of ontologies in less complex logics, such as or. The presented method computes uniform interpolants on the basis of a new resolution calculus for. The output of our method is expressed using, which is extended with fixpoint operators, to always enable a finite representation of the uniform interpolant. If the uniform interpolant uses fixpoint operators, it can be represented in without fixpoints operators using additional concept symbols or by approximation. © 2014 Springer International Publishing Switzerland.
UR - https://www.scopus.com/pages/publications/84958521270
UR - https://www.scopus.com/inward/citedby.url?scp=84958521270&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-08587-6_34
DO - 10.1007/978-3-319-08587-6_34
M3 - Conference contribution
SN - 9783319085869
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 434
EP - 448
BT - Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings
PB - Springer Verlag
Y2 - 19 July 2014 through 22 July 2014
ER -