Interpolants and Explicit Definitions in Extensions of the Description Logic EL
Marie Fortin, Boris Konev, Frank Wolter

TL;DR
This paper investigates the existence and complexity of interpolants and explicit definitions in various extensions of the description logic EL, revealing that most extensions lack certain properties but still allow polynomial or exponential time decision procedures.
Contribution
It demonstrates that interpolant and explicit definition existence can be decided efficiently in many EL extensions, contrasting with the complexity in more expressive DLs.
Findings
Most EL extensions lack Craig interpolation and Beth definability.
Existence of interpolants and explicit definitions is decidable in polynomial or exponential time.
Size bounds for interpolants and definitions are tight, with single or double exponential complexity.
Abstract
We show that the vast majority of extensions of the description logic do not enjoy the Craig interpolation nor the projective Beth definability property. This is the case, for example, for with nominals, with the universal role, with a role inclusion of the form , and for . It follows in particular that the existence of an explicit definition of a concept or individual name cannot be reduced to subsumption checking via implicit definability. We show that nevertheless the existence of interpolants and explicit definitions can be decided in polynomial time for standard tractable extensions of (such as ) and in ExpTime for and various extensions. It follows that these existence problems are not harder than subsumption which is in sharp contrast…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Logic, programming, and type systems · Semantic Web and Ontologies
