Abstract: "Completeness of binary resolution is defined in refutation form: if a set of clauses in first order logic is inconsistent, then the empty clause ([symbol]) can be deduced by binary resolution. In this paper we formulate and prove an extended completeness theorem for binary resolution...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Kossen, Louis (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1990
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 90,23
Schlagworte:	Künstliche Intelligenz Artificial intelligence Machine learning
Online-Zugang:	kostenfrei
Zusammenfassung:	Abstract: "Completeness of binary resolution is defined in refutation form: if a set of clauses in first order logic is inconsistent, then the empty clause ([symbol]) can be deduced by binary resolution. In this paper we formulate and prove an extended completeness theorem for binary resolution. It will be proved that for each clause which is a non-trivial logical consequence of a theory, a clause subsuming that clause can be generated by binary resolution. An extended completeness theorem will also be formulated and proved for P b1 s resolution. Furthermore we will show how extended completeness can be applied to knowledge based systems. According to refutation completeness, resolution can be used to deduce a fact by refuting its negation These refutation proofs are hard to understand. We will show, by extended completeness, that in the propositional case resolution can be used to generate a set of so-called non-trivial minimal logical consequences together with an explanation of these consequences. This set contains also the facts which can be verified by means of refutation completeness. Our approach contributes to better explanation facilities of knowledge based systems.
Beschreibung:	12 S.