Cyclic Proofs with Ordering Constraints - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Cyclic Proofs with Ordering Constraints


CLKID ω is a sequent-based cyclic inference system able to reason on first-order logic with inductive definitions. The current approach for verifying the soundness of CLKID ω proofs is based on expensive model-checking techniques leading to an explosion in the number of states. We propose proof strategies that guarantee the soundness of a class of CLKID ω proofs if some ordering and derivability constraints are satisfied. They are inspired from previous works about cyclic well-founded induction reasoning, known to provide effective sets of ordering constraints. A derivability constraint can be checked in linear time. Under certain conditions, one can build proofs that implicitly satisfy the ordering constraints.
Fichier principal
Vignette du fichier
Str_10501_2017a.pdf (445.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01590651 , version 1 (21-09-2017)



Sorin Stratulat. Cyclic Proofs with Ordering Constraints. TABLEAUX 2017 (26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods), Sep 2017, Brasilia, Brazil. pp.311 - 327, ⟨10.1007/978-3-319-66902-1_19⟩. ⟨hal-01590651⟩
53 View
235 Download



Gmail Facebook X LinkedIn More