Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Completeness of resolution and superposition calculi

Socher-Ambrosius, Rolf

MPI-I-92-224. June 1992, 9 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-92-224.pdfMPI-I-92-224.pdfMPI-I-92-224.ps832 KBytes; 75 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Socher-Ambrosius, Rolf},
  TITLE = {Completeness of resolution and superposition calculi},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-224},
  MONTH = {June},
  YEAR = {1992},
  ISSN = {0946-011X},