The completeness of gp-resolution for annotated logics (Q1205717)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The completeness of gp-resolution for annotated logics |
scientific article; zbMATH DE number 148035
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The completeness of gp-resolution for annotated logics |
scientific article; zbMATH DE number 148035 |
Statements
The completeness of gp-resolution for annotated logics (English)
0 references
1 April 1993
0 references
We show that \(gp\)-resolution is refutation complete for arbitrary sets of clauses. As a by-product, we show that the merging operation in \(gp\)- resolution may be simplified.
0 references
refutation completeness
0 references
\(gp\)-resolution
0 references
0 references
