A Computational Study of Satisfiability Algorithms for Propositional Logic (Q4319327)

From MaRDI portal
Revision as of 01:46, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 709996
Language Label Description Also known as
English
A Computational Study of Satisfiability Algorithms for Propositional Logic
scientific article; zbMATH DE number 709996

    Statements

    A Computational Study of Satisfiability Algorithms for Propositional Logic (English)
    0 references
    0 references
    0 references
    0 references
    11 January 1995
    0 references
    algorithms
    0 references
    satisfiability problem
    0 references
    propositional logic
    0 references
    tree search
    0 references

    Identifiers