• Publications
  • Influence
Understanding Resolution Proofs through Herbrand's Theorem
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 implementationExpand
  • 12
  • 2
  • PDF
Advanced Proof Viewing in ProofTool
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. GraphicalExpand
  • 11
  • 2
  • PDF
Automated reasoning in normative detachment structures with ideal conditions
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 textsExpand
  • 5
  • 1
  • PDF
NAI: The Normative Reasoner
  • 3
  • 1
PROOFTOOL: a GUI for the GAPT Framework
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 butExpand
  • 14
  • PDF
The Proof Certifier Checkers
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 proofExpand
  • 19
Functions-as-Constructors Higher-Order Unification
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 thatExpand
  • 11
  • PDF
System Description: The Proof Transformation System CERES
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 mathematicalExpand
  • 7
  • PDF
Proving Determinacy of the PharOS Real-Time Operating System
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. TheExpand
  • 4
  • PDF
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 proofExpand
  • 4
  • PDF