Proof reconstruction is the operation of extracting the computed proof from the trace of a theorem-proving run. We study the problem of proof reconstruction in distributed theorem proving: because of the distributed nature of the derivation and especially because of deletions of clauses by contraction, it may happen that a deductive process generates the empty clause, but does not have all the necessary information to reconstruct the proof. We analyze this problem and we present a method for distributed theorem proving, called Modified Clause-Diffusion, which guarantees that the deductive process that generates the empty clause will be able to reconstruct the distributed proof. This result is obtained without imposing a centralized control on the deductive processes or resorting to a round of post-processing with ad hoc communication. We prove that Modified Clause-Diffusion is fair (hence complete) and guarantees proof reconstruction. First we define a set of conditions, next we prove that they are sufficient for proof reconstruction, then we show that Modified Clause-Diffusion satisfies them. Fairness is proved in the same way, which has the advantage that the sufficient conditions provide a treatment of the problem relevant for distributed theorem proving in general.

On the reconstruction of proofs in distributed theorem proving: a modified Clause-Diffusion method

BONACINA, Maria Paola
1996-01-01

Abstract

Proof reconstruction is the operation of extracting the computed proof from the trace of a theorem-proving run. We study the problem of proof reconstruction in distributed theorem proving: because of the distributed nature of the derivation and especially because of deletions of clauses by contraction, it may happen that a deductive process generates the empty clause, but does not have all the necessary information to reconstruct the proof. We analyze this problem and we present a method for distributed theorem proving, called Modified Clause-Diffusion, which guarantees that the deductive process that generates the empty clause will be able to reconstruct the distributed proof. This result is obtained without imposing a centralized control on the deductive processes or resorting to a round of post-processing with ad hoc communication. We prove that Modified Clause-Diffusion is fair (hence complete) and guarantees proof reconstruction. First we define a set of conditions, next we prove that they are sufficient for proof reconstruction, then we show that Modified Clause-Diffusion satisfies them. Fairness is proved in the same way, which has the advantage that the sufficient conditions provide a treatment of the problem relevant for distributed theorem proving in general.
1996
Automated theorem proving; distributed deduction; contraction-based theorem proving; distributed proof reconstruction; distributed fairness
File in questo prodotto:
File Dimensione Formato  
JSC1996mcd.pdf

accesso aperto

Descrizione: Articolo
Tipologia: Documento in Post-print
Licenza: Creative commons
Dimensione 163.36 kB
Formato Adobe PDF
163.36 kB Adobe PDF Visualizza/Apri

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/11562/300539
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 11
social impact