Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures (Extended Technical Report)

04/27/2021
by   Christian Alrabbaa, et al.
0

Logic-based approaches to AI have the advantage that their behavior can in principle be explained to a user. If, for instance, a Description Logic reasoner derives a consequence that triggers some action of the overall system, then one can explain such an entailment by presenting a proof of the consequence in an appropriate calculus. How comprehensible such a proof is depends not only on the employed calculus, but also on the properties of the particular proof, such as its overall size, its depth, the complexity of the employed sentences and proof steps, etc. For this reason, we want to determine the complexity of generating proofs that are below a certain threshold w.r.t. a given measure of proof quality. Rather than investigating this problem for a fixed proof calculus and a fixed measure, we aim for general results that hold for wide classes of calculi and measures. In previous work, we first restricted the attention to a setting where proof size is used to measure the quality of a proof. We then extended the approach to a more general setting, but important measures such as proof depth were not covered. In the present paper, we provide results for a class of measures called recursive, which yields lower complexities and also encompasses proof depth. In addition, we close some gaps left open in our previous work, thus providing a comprehensive picture of the complexity landscape.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2020

Finding Small Proofs for Description Logic Entailments: Theory and Practice (Extended Technical Report)

Logic-based approaches to AI have the advantage that their behaviour can...
research
05/19/2022

Evonne: Interactive Proof Visualization for Description Logics (System Description) – Extended Version

Explanations for description logic (DL) entailments provide important su...
research
11/11/2022

Under Lock and Key: A Proof System for a Multimodal Logic

We present a proof system for a multimodal logic, based on our previous ...
research
06/17/2020

Proof Complexity of Substructural Logics

In this paper, we investigate the proof complexity of a wide range of su...
research
07/03/2023

Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations

In this paper I will develop a lambda-term calculus, lambda-2Int, for a ...
research
06/14/2022

Integrating deduction and model finding in a language independent setting

Software artifacts are ubiquitous in our lives being an essential part o...
research
08/07/2023

Combining Proofs for Description Logic and Concrete Domain Reasoning (Technical Report)

Logic-based approaches to AI have the advantage that their behavior can ...

Please sign up or login with your details

Forgot password? Click here to reset