Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Understanding Resolution Proofs through Herbrand's Theorem

- Stefan Hetzl, Tomer Libal, Martin Riener, Mikheil Rukhaia
- Computer Science, Mathematics
- TABLEAUX
- 16 September 2013

Computer-generated proofs are usually difficult to grasp for a human reader. In this paper we present an approach to understanding resolution proofs through Herbrand’s theorem and the implementation… Expand

Advanced Proof Viewing in ProofTool

- Tomer Libal, Martin Riener, Mikheil Rukhaia
- Computer Science, Mathematics
- UITP
- 29 October 2014

Sequent calculus is widely used for formalizing proofs. However, due to the proliferation of data, un- derstanding the proofs of even simple mathematical arguments soon becomes impossible. Graphical… Expand

Automated reasoning in normative detachment structures with ideal conditions

- Tomer Libal, M. Pascucci
- Computer Science
- ICAIL '19
- 23 October 2018

In this article we introduce a logical structure for normative reasoning, called Normative Detachment Structure with Ideal Conditions, that can be used to represent the content of certain legal texts… Expand

PROOFTOOL: a GUI for the GAPT Framework

- Tsvetan Dunchev, A. Leitsch, +4 authors Bruno Woltzenlogel Paleo
- Computer Science
- UITP
- 2012

This paper introduces PROOFTOOL, the graphical user interface for the General Architecture for Proof Theory (GAPT) framework. Its features are described with a focus not only on the visualization but… Expand

The Proof Certifier Checkers

- Zakaria Chihani, Tomer Libal, G. Reis
- Computer Science
- TABLEAUX
- 21 September 2015

Different theorem provers work within different formalisms and paradigms, and therefore produce various incompatible proof objects. Currently there is a big effort to establish foundational proof… Expand

Functions-as-Constructors Higher-Order Unification

- Tomer Libal, D. Miller
- Computer Science, Mathematics
- FSCD
- 22 June 2016

Unification is a central operation in the construction of a range of computational logic systems based on first-order and higher-order logics. First-order unification has a number of properties that… Expand

System Description: The Proof Transformation System CERES

- Tsvetan Dunchev, A. Leitsch, Tomer Libal, D. Weller, Bruno Woltzenlogel Paleo
- Computer Science
- IJCAR
- 16 July 2010

Cut-elimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical… Expand

Proving Determinacy of the PharOS Real-Time Operating System

- S. Azaiez, D. Doligez, Matthieu Lemerre, Tomer Libal, S. Merz
- Mathematics, Computer Science
- ABZ
- 23 May 2016

Executions in the PharOS real-time system are deterministic in the sense that the sequence of local states for every process is independent of the order in which processes are scheduled. The… Expand

The Proof Certifier Checkers 1

Different theorem provers work within different formalisms and paradigms, and therefore produce various incompatible proof objects. Currently there is a big effort to establish foundational proof… Expand

- 4
- PDF