Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093)

From MaRDI portal
Revision as of 15:32, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Resolution vs. cutting plane solution of inference problems: Some computational experience
scientific article

    Statements

    Resolution vs. cutting plane solution of inference problems: Some computational experience (English)
    0 references
    1988
    0 references
    Resolvents in the propositional calculus correspond to certain cutting planes in integer programming models of inference problems. We compare the performance of a rudimentary cutting plane algorithm that uses only resolvents as cuts with that of `set-of-support' resolution on random inference problems. The cutting plane algorithm is orders of magnitude faster on problems in which the premises do not imply the given proposition (i.e., the majority of random problems), and moderately faster on other random problems.
    0 references
    Resolvents
    0 references
    propositional calculus
    0 references
    cutting planes
    0 references
    inference problems
    0 references
    resolution
    0 references
    0 references

    Identifiers