A dual algorithm for the satisfiability problem

DOI10.1016/0020-0190(91)90139-9zbMath0713.68037OpenAlexW1985449594MaRDI QIDQ750165

Yoshihiro Tanaka

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90139-9

zbMATH Keywords

combinatorial problemssatisfiabilityDavis-Putnam procedureKarnaugh map

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items

Counting for satisfiability by inverting resolution

Cites Work

• Resolution vs. cutting plane solution of inference problems: Some computational experience
• Some results and experiments in programming techniques for propositional logic
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• Solving propositional satisfiability problems
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• A Computing Procedure for Quantification Theory
• The complexity of theorem-proving procedures