Solving SAT by algorithm transform of Wu's method

DOI10.1007/BF02948788MaRDI QIDQ1966110zbMATH OpenFDO

Authors Simin He, Bo Zhang

Publication date 24 February 2000

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

SATpropositional satisfiability problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Solving SAT problems by orthogonal method
• scientific article; zbMATH DE number 956858
• scientific article; zbMATH DE number 956865
• New worst-case upper bounds for SAT
• New worst-case upper bounds for SAT

Cites work

• scientific article; zbMATH DE number 41806 (Why is no real title available?)
• A Machine-Oriented Logic Based on the Resolution Principle
• A machine program for theorem-proving
• Automatic Theorem Proving With Renamable and Semantic Resolution
• Basic principles of mechanical theorem proving in elementary geometries
• The intractability of resolution

Cited in

(3)

• Time-free solution to SAT problem by tissue P systems
• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
• Solving SAT problems by orthogonal method

This page was built for publication: Solving SAT by algorithm transform of Wu's method

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