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.

A.Asperti, E.Tassi. (2007). Higher order proof reconstruction from paramodulation-based refutations: the unit equality case..

Higher order proof reconstruction from paramodulation-based refutations: the unit equality case.

ASPERTI, ANDREA;TASSI, ENRICO
2007

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.
2007
Towards Mechanized Mathematical Assistants
146
160
A.Asperti, E.Tassi. (2007). Higher order proof reconstruction from paramodulation-based refutations: the unit equality case..
A.Asperti; E.Tassi.
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/46911
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 8
social impact