Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case

Authors:
Andrea Asperti;Enrico Tassi
Affiliations:
Department of Computer Science, University of Bologna, Mura Anteo Zamboni, 7 -- 40127 Bologna, Italy;Department of Computer Science, University of Bologna, Mura Anteo Zamboni, 7 -- 40127 Bologna, Italy
Venue:
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Year:
2007

Citing 10
Cited 2

A uniform procedure for converting matrix proofs into sequent-style systems

Information and Computation
The TPTP Problem Library

Journal of Automated Reasoning
Solution of the Robbins Problem

Journal of Automated Reasoning
Integrating Gandalf and HOL

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
A Resolution Theorem Prover for Intuitonistic Logic

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Automation for interactive proof: first prototype

Information and Computation - Special issue: Combining logical systems
The design and implementation of VAMPIRE

AI Communications - CASC
User Interaction with the Matita Proof Assistant

Journal of Automated Reasoning
Importing HOL into Isabelle/HOL

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Smart matching

AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
A foundational view on integration problems

MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address the problem of reconstructing a higher order, checkable proof object starting from a proof trace left by a first order automatic proof searching procedure, in a restricted equational framework. The automatic procedure is based on superposition rules for the unit equality case. Proof transformation techniques aimed to improve the readability of the final proof are discussed.