Extraction of Proofs from the Clausal Normal Form Transformation

Authors:
Hans de Nivelle
Affiliations:
-
Venue:
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Year:
2002

Citing 10
Cited 2

Using Reflection to Build Efficient and Certified Decision Procedures

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Proof Terms for Simply Typed Higher Order Logic

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Translating Machine-Generated Resolution Proofs into ND-Proofs at the Assertion Level

PRICAI '96 Proceedings of the 4th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
Analytic and Non-analytic Proofs

Proceedings of the 7th International Conference on Automated Deduction
A Resolution Decision Procedure for the Guarded Fragment

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Automated Proof Construction in Type Theory Using Resolution

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Logical frameworks

Handbook of automated reasoning
Proof-assistants using dependent type systems

Handbook of automated reasoning
Term indexing

Handbook of automated reasoning
Combining superposition, sorts and splitting

Handbook of automated reasoning

Translation of resolution proofs into short first-order proofs without choice axioms

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Translation of resolution proofs into short first-order proofs without choice axioms

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the problem of how to transform a first-order formula into clausal normal form, and to simultaneously construct a proof that the clausal normal form is correct. This is relevant for applications of automated theorem proving where people want to be able to use theorem prover without having to trust it.