Automatic generation of implied clauses for SAT

DOI10.1007/3-540-45578-7_62MaRDI QIDQ4475691zbMATH OpenFDO

Authors Lyndon Drake

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390761.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Resolution versus search: Two strategies for SAT
• Resolution versus search: Two strategies for SAT
• Implementing the Davis-Putnam method
• scientific article; zbMATH DE number 2090309
• The quest for efficient Boolean satisfiability solvers

Cited in

(2)

• Resolution in solving graph problems
• Improving SAT algorithms by using search pruning techniques

This page was built for publication: Automatic generation of implied clauses for SAT

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