Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Algorithmic introduction of quantified cuts
Introducing Quantified Cuts in Logic with Equality
- Stefan Hetzl, A. Leitsch, Giselle Reis, Janos Tapolczai, D. Weller
- Computer ScienceIJCAR
- 11 February 2014
It is shown that the extension of the method to handle equality and quantifier-blocks leads to a substantial improvement of the old algorithm.
System Description: GAPT 2.0
- Gabriel Ebner, Stefan Hetzl, Giselle Reis, Martin Riener, Simon Wolfsteiner, Sebastian Zivota
- Computer ScienceIJCAR
- 27 June 2016
GAPT General Architecture for Proof Theory is a proof theory framework containing data structures, algorithms, parsers and other components common in proof theory and automated deduction. In contrast…
Formalized meta-theory of sequent calculi for linear logics
Facilitating Meta-Theory Reasoning (Invited Paper)
- Giselle Reis
- Computer ScienceElectronic Proceedings in Theoretical Computer…
- 16 July 2021
This paper will present some techniques that I have been involved in for facilitating meta-theory reasoning, and their combinatorial nature suggests they could be automated.
An extended framework for specifying and reasoning about proof systems
This paper shows how to extend the framework with subexponentials in order to declaratively encode a wider range of proof systems, including a number of non-trivial proof systems such as multi-conclusion intuitionistic logic, classical modal logic S4, intuitionistic Lax logic, and Negri’s labelled proof systems for different modal logics.
Specifying Proof Systems in Linear Logic with Subexponentials
Mechanizing Focused Linear Logic in Coq
The Proof Certifier Checkers
The architecture of Checkers is described and it is demonstrated how it can be used to check proof objects by supplying the fpc specification for a subset of the inferences used by eprover and checking proofs using these inferences.
On the Generation of Quantified Lemmas
- Gabriel Ebner, Stefan Hetzl, A. Leitsch, Giselle Reis, D. Weller
- Mathematics, Computer ScienceJournal of Automated Reasoning
- 15 June 2019
An algorithmic method of lemma introduction based on an inversion of Gentzen’s cut-elimination method for sequent calculus capable of introducing several universal lemmas given a proof in predicate logic with equality.