Mikheil Rukhaia

Learn More
This paper describes a new feature of the GAPT framework, namely the ability to import refutations obtained from external automated theorem provers. To cope with coarse-grained, under-specified and non-standard inference rules used by various theorem provers, the technique of proof replaying is employed. The refutations provided by external theorem provers(More)
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 visual-ization but also on the analysis and transformation of proofs and related tree-like structures, and its implementation is explained. Finally, PROOFTOOL is compared with(More)
This paper describes the implementation, as well as the features, of the graphical user interface, more specifically defined as a proof viewer, for the General Architecture for Proof Theory (GAPT) framework. It contains methods to render classical and schematic sequent calculus proofs as well as resolution proofs and other tree-like structures in a flexible(More)
The cut-elimination method CERES (for first-and higher-order classical logic) is based on the notion of a characteristic clause set, which is extracted from an LK-proof and is always unsatisfiable. A resolution refutation of this clause set can be used as a skeleton for a proof with atomic cuts only (atomic cut normal form). This is achieved by replacing(More)
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 of a tool based on that approach. The information we take as primitive is which instances have been chosen for which quantifiers, in other words: an expansion(More)
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 of a tool based on that approach. The information we take as primitive is which instances have been chosen for which quantifiers, in other words: an expansion(More)
Preface The goal of the PxTP workshop series is to bring together researchers working on proof production from automated theorem provers with potential consumers of proofs. Machine-checkable proofs have been proposed for applications like proof-carrying code and certified compilation, as well as for exchanging knowledge between different automated reasoning(More)
  • Univ, Phil Alexander Leitsch, Manfred, Tomer Líbal, Cvetan Dunchev, Stefan Hetzl +14 others
  • 2012
(Ort, Datum) (Unterschrift Verfasser) i Acknowledgements I would like to express my deepest gratitude to my advisor, Alexander Leitsch. First for allowing me to participate in the interesting multidisciplinary research done in his group. Second, for showing great patience when my own interest deviated a little from the project goals before converging again(More)
  • 1