A dual algorithm for the satisfiability problem

DOI10.1016/0020-0190(91)90139-9MaRDI QIDQ750165zbMATH OpenOpenAlexFDO

Authors 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

satisfiabilitycombinatorial problemsDavis-Putnam procedureKarnaugh map

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• scientific article; zbMATH DE number 956858
• An exact and a randomized approach for the satisfiability problem
• Probabilistic performance of a heurisic for the satisfiability problem
• scientific article; zbMATH DE number 6117305
• Solving propositional satisfiability problems

Cites work

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

Cited in

(5)

• scientific article; zbMATH DE number 1182571 (Why is no real title available?)
• The unreasonable effectiveness of alternation-based satisfiabiity algorithms
• Quasiphysical and quasisociological algorithm Solar for solving SAT problem
• Solving SAT problems by orthogonal method
• Counting for satisfiability by inverting resolution

This page was built for publication: A dual algorithm for the satisfiability problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750165)