International audienceCyclic induction is a powerful reasoning technique that can soundly stop the proof development and make the proof experience successful. In the setting of first-order logic with inductive definitions (FOLID), cyclic proofs can be built automatically by the Cyclist prover but their implementations are error-prone and the human validation may be tedious. On the other hand, cyclic induction is not yet integrated in certifying proof environments that support first-order logic and inductive definitions, as Isabelle and Coq
Abstract—Brotherston and Simpson [citation] have formalized and investigated cyclic reasoning, reach...
International audienceIn this paper we develop a cyclic proof system for the problem of inclusion be...
International audienceIt is the exception that provers share and trust each others proofs. One reaso...
International audienceChecking the soundness of cyclic induction reasoning for first-order logic wit...
Checking the soundness of cyclic induction reasoning for first-order logic with inductive definition...
Résumé présenté à la conférence CiSS 2019 (Circularity in Syntax and Semantics) à Goteborg en Suède....
International audienceIn first-order logic, the formula-based instances of the Noetherian induction ...
International audienceStructural and (Noetherian) cyclic induction are two instances of the Noetheri...
International audienceCLKID ω is a sequent-based cyclic inference system able to reason on first-ord...
Abstract. We describe the design and implementation of an automated theorem prover realising a fully...
Noetherian induction is one of the most general induction principles used in formal reasoning. In th...
Induction is a powerful proof technique adapted to reason on sets with an unbounded number of elemen...
The original publication is available at www.springerlink.com.International audienceWe give evidence...
International audienceInduction is a powerful proof technique adapted to reason on sets with an unbo...
We propose a new cyclic proof system for automated, equational reasoning about the behaviour of pure...
Abstract—Brotherston and Simpson [citation] have formalized and investigated cyclic reasoning, reach...
International audienceIn this paper we develop a cyclic proof system for the problem of inclusion be...
International audienceIt is the exception that provers share and trust each others proofs. One reaso...
International audienceChecking the soundness of cyclic induction reasoning for first-order logic wit...
Checking the soundness of cyclic induction reasoning for first-order logic with inductive definition...
Résumé présenté à la conférence CiSS 2019 (Circularity in Syntax and Semantics) à Goteborg en Suède....
International audienceIn first-order logic, the formula-based instances of the Noetherian induction ...
International audienceStructural and (Noetherian) cyclic induction are two instances of the Noetheri...
International audienceCLKID ω is a sequent-based cyclic inference system able to reason on first-ord...
Abstract. We describe the design and implementation of an automated theorem prover realising a fully...
Noetherian induction is one of the most general induction principles used in formal reasoning. In th...
Induction is a powerful proof technique adapted to reason on sets with an unbounded number of elemen...
The original publication is available at www.springerlink.com.International audienceWe give evidence...
International audienceInduction is a powerful proof technique adapted to reason on sets with an unbo...
We propose a new cyclic proof system for automated, equational reasoning about the behaviour of pure...
Abstract—Brotherston and Simpson [citation] have formalized and investigated cyclic reasoning, reach...
International audienceIn this paper we develop a cyclic proof system for the problem of inclusion be...
International audienceIt is the exception that provers share and trust each others proofs. One reaso...