Solving SAT by algorithm transform of Wu's method

DOI10.1007/BF02948788zbMATH Open0944.68196MaRDI QIDQ1966110FDOQ1966110

Authors: Simin He, Bo Zhang 

Publication date: 24 February 2000

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

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

zbMATH Keywords

SATpropositional satisfiability problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• A Machine-Oriented Logic Based on the Resolution Principle
• A machine program for theorem-proving
• Title not available (Why is that?)
• Automatic Theorem Proving With Renamable and Semantic Resolution
• The intractability of resolution
• Basic principles of mechanical theorem proving in elementary geometries

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)