The completeness of gp-resolution for annotated logics (Q1205717)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The completeness of gp-resolution for annotated logics
scientific article

    Statements

    The completeness of gp-resolution for annotated logics (English)
    0 references
    0 references
    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

    Identifiers