Solving Satisfiability with Less Searching (Q3335000)

From MaRDI portal
Revision as of 08:42, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Solving Satisfiability with Less Searching
scientific article

    Statements

    title
    Solving Satisfiability with Less Searching (English)
    0 references
    publication date
    1984
    0 references
    zbMATH DE Number
    3868629
    0 references
    zbMATH Keywords
    complement searching
    0 references
    satisfiability
    0 references
    constraint satisfaction
    0 references
    Search trees
    0 references
    subtrees
    0 references
    Davis-Putnam procedure
    0 references
    conjunctive normal form predicates
    0 references
    pure literals
    0 references
    Wikidata QID
    Q84832670
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3335000&oldid=22454946"
    Powered by MediaWiki