English

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Extraction of Proofs from the Clausal Normal Form Transformation

MPS-Authors
/persons/resource/persons44298

de Nivelle,  Hans
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

de Nivelle, H. (2002). Extraction of Proofs from the Clausal Normal Form Transformation. In Computer Science Logic: 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL (pp. 584-598). Berlin, Germany: Springer.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2F7E-D
Abstract
We give techniques for extracting proofs from the Clausal Normal Form transformation. We discuss and solve three technical problems: {\bf (1)}. How to handle the introduction of definitions and Skolem functions. {\bf (2)}. How to generate short (linear size) proofs. {\bf (3)}. How to handle optimized Skolemization. We reduce it to standard Skolemization.