4 citations · 8 across the 3 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2021
E-Cyclist: Implementation of an Efficient Validation of FOLID Cyclic Induction Reasoning
Sorin Stratulat
Checking the soundness of cyclic induction reasoning for first-order logic with inductive definitions (FOLID) is decidable but the standard checking method is based on an exponenti…
cs.LO2018★ 4 cited
Validating Back-links of FOLID Cyclic Pre-proofs
Sorin Stratulat
Cyclic pre-proofs can be represented as sets of finite tree derivations with back-links. In the frame of the first-order logic with inductive definitions, the nodes of the tree der…
cs.LO2013★ 4 cited
Performing Implicit Induction Reasoning with Certifying Proof Environments
Amira Henaien, Sorin Stratulat
Largely adopted by proof assistants, the conventional induction methods based on explicit induction schemas are non-reductive and local, at schema level. On the other hand, the imp…