Please use this identifier to cite or link to this item: doi:10.22028/D291-40237
Title: Another Technique for Proving Completeness of Resolution
Author(s): Socher-Ambrosius, Rolf
Language: English
Year of Publication: 1989
Place of publication: Kaiserslautern
Free key words: Resolution Theorem Proving
Completeness Proofs
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: This paper contains a very short proof of the refutation completeness of ground resolution, that is, it proves that each inconsistent set S of ground clauses admits a resolution derivation of the empty clause. The proof technique works uniformly for pure resolution, hyperresolution and ordered resolution.
Link to this record: urn:nbn:de:bsz:291--ds-402375
hdl:20.500.11880/37660
http://dx.doi.org/10.22028/D291-40237
Series name: SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447]
Series volume: 89,5
Date of registration: 17-May-2024
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Professorship: SE - Sonstige
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes



Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.