de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Completeness of resolution and superposition calculi

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44009

Socher-Ambrosius,  Rolf
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

MPI-I-92-224.pdf
(Any fulltext), 75KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Socher-Ambrosius, R.(1992). Completeness of resolution and superposition calculi (MPI-I-92-224). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B1D7-B
Abstract
We modify Bezem's (Bezem, M. Completeness of Resolution Revisited. Theoretical Computer Science 74 (1990) 227-237) completeness proof for ground resolution in order to deal with ordered resolution, redundancy, and equational reasoning in form of superposition. The resulting proof is completely independent of the cardinality of the set of clauses.