Living Without Beth and Craig: Explicit Definitions and Interpolants in Description Logics with Nominals

07/06/2020
by   Alessandro Artale, et al.
0

The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (BDP) states that an explicit definition exists iff a formula stating implicit definability is valid. Thus, they transform potentially hard existence problems into deduction problems in the underlying logic. Description Logics with nominals do not have the CIP nor BDP, but in particular, deciding and computing explicit definitions of concepts or individuals has many potential applications in ontology engineering and ontology-based data management. In this article we show two main results: even without Craig and Beth, the existence of interpolants and explicit definitions is decidable in the description logics with nominals ALCO and ALCIO. However, living without Craig and Beth makes this problem harder than deduction: we prove that the existence problems become 2ExpTime-complete, thus one exponential harder than validity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/03/2020

Living without Beth and Craig: Explicit Definitions and Interpolants in the Guarded Fragment

The guarded fragment of FO fails to have the Craig Interpolation Propert...
research
02/15/2022

Interpolants and Explicit Definitions in Extensions of the Description Logic EL

We show that the vast majority of extensions of the description logic ℰℒ...
research
03/08/2023

Definitions and (Uniform) Interpolants in First-Order Modal Logic

We first consider two decidable fragments of quantified modal logic 𝖲5: ...
research
09/22/2021

A formalisation of BPMN in Description Logics

In this paper we present a textual description, in terms of Description ...
research
04/14/2011

Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics

We study uniform interpolation and forgetting in the description logic A...
research
02/19/2012

Towards an efficient prover for the C1 paraconsistent logic

The KE inference system is a tableau method developed by Marco Mondadori...
research
03/30/2019

Ontology Focusing: Knowledge-enriched Databases on Demand

We propose a novel framework to facilitate the on-demand design of data-...

Please sign up or login with your details

Forgot password? Click here to reset