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

Tim S. Lyon, Jonas Karge
4/24/2024
cs.LOcs.AIcs.DB

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lyon2024constructive,
  title  = {Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents},
  author = {Tim S. Lyon and Jonas Karge},
  year   = {2024},
  eprint = {2404.15840},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.15840v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.15840.svg)](https://codeofpaper.com/paper/2404.15840)

Discussion