English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms

de Nivelle, H. (2005). Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms. Information and Computation, 199, 24-54.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
de Nivelle, Hans1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: We present a way of transforming a resolution-style proof containing Skolemization into a natural deduction proof without Skolemization. The size of the proof increases only moderately (polynomially). This makes it possible to translate the output of a resolution theorem prover into a purely first-order proof that is moderate in size.

Details

show
hide
Language(s): eng - English
 Dates: 2005-12-212005
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 279100
Other: Local-ID: C1256104005ECAFC-904AC741B97386B6C1256FC10056F74F-deNivelle2005a
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Information and Computation
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 199 Sequence Number: - Start / End Page: 24 - 54 Identifier: -