Solving SAT problem by heuristic polarity decision-making algorithm

DOI10.1007/S11432-007-0070-1MaRDI QIDQ2465749zbMATH OpenOpenAlexFDO

Authors Minge Jing, Dian Zhou, P.-S. Tang, Xiaofang Zhou, Hua Zhang

Publication date 7 January 2008

Published in Science in China. Series F (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11432-007-0070-1

zbMATH Keywords

decision-makingSAT problemDPLLcomplete algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Theory and Applications of Satisfiability Testing
• Progress in Artificial Intelligence
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• scientific article; zbMATH DE number 956858
• BerkMin: A fast and robust SAT-solver

Cites work

• A discrete Lagrangian-based global-search method for solving satisfiability problems
• BerkMin: A fast and robust SAT-solver
• Solving propositional satisfiability problems

Cited in

(3)

• scientific article; zbMATH DE number 6519724 (Why is no real title available?)
• scientific article; zbMATH DE number 6874827 (Why is no real title available?)
• DiffSat

Describes a project that uses

Uses Software

• MiniSat
• SATO
• zChaff
• Chaff
• BerkMin

This page was built for publication: Solving SAT problem by heuristic polarity decision-making algorithm

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