Living Without Beth and Craig: Definitions and Interpolants in Description Logics with Nominals and Role Inclusions
Alessandro Artale, Jean Christoph Jung, Andrea Mazzullo, Ana Ozaki, Frank Wolter
Abstract
The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating implicit definability is valid. Thus, the CIP and PBDP reduce potentially hard existence problems to entailment in the underlying logic. Description (and modal) logics with nominals and/or role inclusions do not enjoy the CIP nor the PBDP, but interpolants and explicit definitions have many applications, in particular in concept learning, ontology engineering, and ontology-based data management. In this article we show that, even without Beth and Craig, the existence of interpolants and explicit definitions is decidable in description logics with nominals and/or role inclusions such as ALCO, ALCH and ALCHOI and corresponding hybrid modal logics. However, living without Beth and Craig makes these problems harder than entailment: the existence problems become 2ExpTime-complete in the presence of an ontology or the universal modality, and coNExpTime-complete otherwise. We also analyze explicit definition existence if all symbols (except the one that is defined) are admitted in the definition. In this case the complexity depends on whether one considers individual or concept names. Finally, we consider the problem of computing interpolants and explicit definitions if they exist and turn the complexity upper bound proof into an algorithm computing them, at least for description logics with role inclusions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a40c485d-aaa0-4088-9857-7ac1fac33103Builds on1
Related papers
- Computation and Size of Interpolants for Hybrid Modal LogicsJean Christoph Jung, Jedrzej Kolodziejski, Frank WolterLICS 2026
- Description Logics with Two Types of Definite Descriptions: Complexity, Expressiveness, and Automated DeductionMichal Sochanski, Przemyslaw Andrzej Walega, Michal ZawidzkiAAAI 2026
- First Order Rewritability in Ontology-Mediated Querying in Horn Description LogicsDavid Toman, Grant E. WeddellAAAI 2022 · 5 citations
- On the Completeness of Interpolation AlgorithmsStefan Hetzl, Raheleh JalaliLICS 2024 · 1 citation
- The Price of Selfishness: Conjunctive Query Entailment for ALCSelf Is 2EXPTIME-HardBartosz Bednarczyk, Sebastian RudolphAAAI 2022 · 1 citation
