Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents

April 24, 2024 ยท The Ethereal ยท ๐Ÿ› International Joint Conference on Artificial Intelligence

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tim S. Lyon, Jonas Karge arXiv ID 2404.15840 Category cs.LO: Logic in CS Cross-listed cs.AI, cs.DB, math.LO Citations 5 Venue International Joint Conference on Artificial Intelligence Last Checked 2 months ago
Abstract
We introduce a constructive method applicable to a large number of description logics (DLs) for establishing the concept-based Beth definability property (CBP) based on sequent systems. Using the highly expressive DL RIQ as a case study, we introduce novel sequent calculi for RIQ-ontologies and show how certain interpolants can be computed from sequent calculus proofs, which permit the extraction of explicit definitions of implicitly definable concepts. To the best of our knowledge, this is the first sequent-based approach to computing interpolants and definitions within the context of DLs, as well as the first proof that RIQ enjoys the CBP. Moreover, due to the modularity of our sequent systems, our results hold for restrictions of RIQ, and are applicable to other DLs by suitable modifications.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS