A Complete Cyclic Proof System for Inductive Entailments in First Order Logic - Archive ouverte HAL Access content directly
Conference Papers Year :

A Complete Cyclic Proof System for Inductive Entailments in First Order Logic

(1) , (1)
1
Radu Iosif
  • Function : Author
Cristina Serban
  • Function : Author
  • PersonId : 1035490

Abstract

In this paper we develop a cyclic proof system for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions are quantifier-free formulae of first order logic. The proof system consists of a small set of inference rules, inspired by a top-down language inclusion algorithm for tree automata [9]. We show the proof system to be sound, in general, and complete, under certain semantic restrictions involving the set of constraints in the inductive system. Moreover, we investigate the computational complexity of checking these restrictions, when the function symbols in the logic are given the canonical Herbrand interpretation.
Fichier principal
Vignette du fichier
final.pdf (266.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02388031 , version 1 (30-11-2019)

Identifiers

  • HAL Id : hal-02388031 , version 1

Cite

Radu Iosif, Cristina Serban. A Complete Cyclic Proof System for Inductive Entailments in First Order Logic. {LPAR-22.} 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2018, Awassa, Ethiopia. ⟨hal-02388031⟩
46 View
59 Download

Share

Gmail Facebook Twitter LinkedIn More