English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

de Nivelle, H. (2003). Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms. In Automated deduction, CADE-19: 19th International Conference on Automated Deduction (pp. 365-379). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
de Nivelle, Hans1, Author           
Baader, Franz1, Editor           
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 proof containing Skolemization into a natural deduction proof of the same formula but not using 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: 2004-06-172003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 202045
Other: Local-ID: C1256104005ECAFC-179628522133A695C1256D0A0041B7F3-deNivelle2003b
 Degree: -

Event

show
hide
Title: CADE 2003
Place of Event: Miami, USA
Start-/End Date: 2003-07-28 - 2003-08-02

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 365 - 379 Identifier: ISBN: 3-540-40559-3

Source 2

show
hide
Title: Lecture Notes in Artificial Intelligence
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2741 Sequence Number: - Start / End Page: - Identifier: -