Algorithms for testing the satisfiability of propositional formulae (Q3826123)

From MaRDI portal
Revision as of 01:01, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for testing the satisfiability of propositional formulae
scientific article

    Statements

    title
    Algorithms for testing the satisfiability of propositional formulae (English)
    0 references
    author
    Giorgio Gallo
    0 references
    Giampaolo Urbani
    0 references
    publication date
    1989
    0 references
    zbMATH Keywords
    efficiency
    0 references
    satisfiability for Horn clauses algorithm
    0 references

    Identifiers

    zbMATH DE Number
    4100632
    0 references
    OpenAlex ID
    W2084642537
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3826123&oldid=32706866"
    Powered by MediaWiki