Jul 2026· Electronic Proceedings in Theoretical Computer Science· Vol abs/2607.12658, pp. 58-64· 0 citations· 7 references
Computer Science
TL;DR
This paper introduces the strategy language of Pgeon, a meta-prover with a clear separation between inference rules and proof search, designed to handle the challenge of fair proof search in semi-decidable logics.
Abstract
This paper introduces the strategy language of Pgeon, a meta-prover with a clear separation between inference rules and proof search. We give the semantics of strategies as functions over proof states, and of the operators that are used to combine them, allowing for sequential composition, choice, repetition and interleaving of strategies. This language is designed to handle the challenge of fair proof search in semi-decidable logics, where simple depth-first exploration of the proof space is not guaranteed to achieve completeness. We showcase the expressiveness and effectiveness of the approach through case studies in first-order and modal logics.
This work presents a proof extraction algorithm for versioned e-graphs, an extension of e-graphs that supports branching reasoning contexts and proof by cases and implements it in Vegie, a lightweight automated inductive theorem prover.
George Zakhour, J. Gabriele, Cesário et al.· 0 citations
A proof checker called Nörgler is introduced that builds upon and extends the established approach pioneered by GDV and supports checking propositional, (untyped and typed) first-order, and higher-order refutations represented in TSTP.
Melanie Taprogge, H. Sariyanto, Alexander Steen· 1 citation
This paper provides a setting in which congruences can be treated as actual equalities, mirroring the informal practice of mathematicians and eliminating the need to use the lemmas typically required for formal congruence proofs.
Dale A. Miller· International Conference on...· 0 citations
A bilateral labeled sequent calculus incorporating specific verification and falsification rules incorporating specific verification and falsification rules is introduced on Heinrich Wansing’s constructive connexive logic C, shown to exhibit key structural properties.
Fabio De Martin Polo· Notre Dame Journal of Formal...· 1 citation
GenZ is introduced, a generic theorem prover for sequent calculi implemented in Haskell that allows the user to specify a set of sequent rules, over which it performs proof search, and employs the zipper data structure.
Xiaoshuang Yang, Malvin Gattinger, Marianna Girlando et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
