English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Implementing the clausal normal form transformation with proof generation

de Nivelle, H. (2003). Implementing the clausal normal form transformation with proof generation. In Fourth Workshop on the Implementation of Logics (pp. 69-83). Liverpool, UK: University of Liverpool, University of Manchester.

Item is

Files

show Files

Locators

show

Creators

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

Content

show
hide
Free keywords: -
 Abstract: We explain how to implement the clausal normal form transformation with proof generation. We present a convenient data structure for sequent calculus proofs, which will be used for representing the generated proofs. The data structure allows easy proof checking and generation of proofs. In addition, it allows convenient implementation of proof normalization, which is necessary in order to keep the size of the generated proofs acceptable.

Details

show
hide
Language(s): eng - English
 Dates: 2004-06-212003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 202029
Other: Local-ID: C1256104005ECAFC-FB577616A96B276BC1256E270056CE80-deNivelle2003c
 Degree: -

Event

show
hide
Title: Workshop on the Implementation of Logics
Place of Event: Almaty, Kazachstan
Start-/End Date: 2003-09-26

Legal Case

show

Project information

show

Source 1

show
hide
Title: Fourth Workshop on the Implementation of Logics
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Liverpool, UK : University of Liverpool, University of Manchester
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 69 - 83 Identifier: -