A Clause-Based Heuristic for SAT Solvers-Reference-Cited by-同舟云学术

A Clause-Based Heuristic for SAT Solvers

Published:2005 Issue: Volume: Page:46-60
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing
language:
Short-container-title:

Author:

Dershowitz Nachum,Hanna Ziyad,Nadel Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11499107_4.pdf

Reference18 articles.

1. Alfredsson, J.: The SAT solver Oepir, http://www.lri.fr/~simon/contest/results/ONLINEBOOKLET/OepirA.ps (viewed January 16, 2005)

2. Bayardo Jr., R., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the National Conference on Artificial Intelligence, pp. 203–208 (1997)

3. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM (5), 394–397 (1962)

4. Lecture Notes in Computer Science;N. Eén,2004

5. Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. In: Design, Automation, and Test in Europe (DATE 2002), March 2002, pp. 142–149 (2002)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generating Diverse Solutions in SAT;Theory and Applications of Satisfiability Testing - SAT 2011;2011

2. Assignment Stack Shrinking;Theory and Applications of Satisfiability Testing – SAT 2010;2010

3. On Modern Clause-Learning Satisfiability Solvers;Journal of Automated Reasoning;2009-11-06

4. Deciding Effectively Propositional Logic Using DPLL and Substitution Sets;Automated Reasoning;2008

5. Propositional Satisfiability and Constraint Programming;ACM Computing Surveys;2006-12-25