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

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.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02388031
Contributor : Radu Iosif <>
Submitted on : Saturday, November 30, 2019 - 8:35:48 PM
Last modification on : Wednesday, December 4, 2019 - 1:05:26 AM

File

final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02388031, version 1

Collections

Citation

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

Share

Metrics

Record views

12

Files downloads

17