Résumé présenté à la conférence CiSS 2019 (Circularity in Syntax and Semantics) à Goteborg en Suède.Checking the soundness of the cyclic induction reasoning for first-order logic with in-ductive definitions (FOL_ID) is decidable but the standard checking method is based on a doubly exponential complement operation for Büchi automata. We present a polynomial method 'semi-deciding' this problem; its most expensive steps recall the comparisons with multiset path orderings. In practice, it has been integrated in the Cyclist prover and successfully checked all the proofs included in its distribution. FOL_ID cyclic proofs may also be hard to certify. Our method helps to represent the cyclic induction reasoning as being well-founded, where the ord...
We propose a new cyclic proof system for automated, equational reasoning about the behaviour of pure...
In program veri_cation, measures for proving the termination of programs are typically constructed u...
Cyclic proof systems are sequent-calculus style proof systems that allow circular structures represe...
Checking the soundness of cyclic induction reasoning for first-order logic with inductive definition...
International audienceChecking the soundness of cyclic induction reasoning for first-order logic wit...
International audienceCLKID ω is a sequent-based cyclic inference system able to reason on first-ord...
International audienceCyclic induction is a powerful reasoning technique that can soundly stop the p...
International audienceIn this paper we develop a cyclic proof system for the problem of inclusion be...
We describe the design and implementation of an automated theorem prover realising a fully general n...
International audienceCyclic pre-proofs can be represented as sets of finite tree derivations with b...
Noetherian induction is one of the most general induction principles used in formal reasoning. In th...
International audienceIn first-order logic, the formula-based instances of the Noetherian induction ...
Induction is a powerful proof technique adapted to reason on sets with an unbounded number of elemen...
International audienceInduction is a powerful proof technique adapted to reason on sets with an unbo...
International audienceStructural and (Noetherian) cyclic induction are two instances of the Noetheri...
We propose a new cyclic proof system for automated, equational reasoning about the behaviour of pure...
In program veri_cation, measures for proving the termination of programs are typically constructed u...
Cyclic proof systems are sequent-calculus style proof systems that allow circular structures represe...
Checking the soundness of cyclic induction reasoning for first-order logic with inductive definition...
International audienceChecking the soundness of cyclic induction reasoning for first-order logic wit...
International audienceCLKID ω is a sequent-based cyclic inference system able to reason on first-ord...
International audienceCyclic induction is a powerful reasoning technique that can soundly stop the p...
International audienceIn this paper we develop a cyclic proof system for the problem of inclusion be...
We describe the design and implementation of an automated theorem prover realising a fully general n...
International audienceCyclic pre-proofs can be represented as sets of finite tree derivations with b...
Noetherian induction is one of the most general induction principles used in formal reasoning. In th...
International audienceIn first-order logic, the formula-based instances of the Noetherian induction ...
Induction is a powerful proof technique adapted to reason on sets with an unbounded number of elemen...
International audienceInduction is a powerful proof technique adapted to reason on sets with an unbo...
International audienceStructural and (Noetherian) cyclic induction are two instances of the Noetheri...
We propose a new cyclic proof system for automated, equational reasoning about the behaviour of pure...
In program veri_cation, measures for proving the termination of programs are typically constructed u...
Cyclic proof systems are sequent-calculus style proof systems that allow circular structures represe...