Solving Satisfiability with Less Searching
From MaRDI portal
Publication:3335000
DOI10.1109/TPAMI.1984.4767555zbMath0545.68052WikidataQ84832670 ScholiaQ84832670MaRDI QIDQ3335000
Publication date: 1984
Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)
satisfiabilityconstraint satisfactionsubtreesSearch treesDavis-Putnam procedurecomplement searchingconjunctive normal form predicatespure literals
Related Items
Ordered model trees: A normal form for disjunctive deductive databases, Polynomial-average-time satisfiability problems, Solving propositional satisfiability problems, Simulating circuit-level simplifications on CNF, CHAMP: a multipass algorithm for Max Sat based on saver variables, An artificial neural network satisfiability tester, New methods for 3-SAT decision and worst-case analysis, On a generalization of extended resolution, CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability, An efficient algorithm for the 3-satisfiability problem, A logical framework for depiction and image interpretation, Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences, Present and Future of Practical SAT Solving
