Complete algorithms

Frontiers in Artificial Intelligence and Applications

Volumn 185, Issue 1, 2009, Pages 99-130

  Darwiche, Adnan ^a   Pipatsrisawat, Knot ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY;

CLAUSE LEARNING; DPLL ALGORITHM; PROOF SYSTEM; REAL-WORLD; SAT PROBLEMS; SAT SOLVERS; SAT-SOLVING;

MODEL CHECKING;

EID: 72949092286     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-929-5-99     Document Type: Article

References (63)

1. F. A. Aloul, I. L. Markov, and K. A. Sakallah. Faster sat and smaller bdds via common function structure. In Technical Report #CSETR- 445-01. University of Michigan, November 2001.
2. A. S. M. Aguirre and M. Y. Vardi. Random 3-SAT and BDDs: The plot thickens further. In Principles and Practice of Constraint Programming, pages 121-136, 2001.
3. F. Bacchus. Enhancing davis putnam with extended binary clause reasoning. In AAAI/IAAI, pages 613-619, 2002.
4. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic Model Checking: 1020 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Com puter Science, pages 1-33, Washington, D.C., 1990. IEEE Computer Society Press.
5. A. Biere. Picosat versions 535, 2007. Solver description, SAT Competition 2007.
6. P. Beame, H. Kautz, and A. Sabharwal. Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research, 22:319-351, 2004.
7. L. Baptista and J. P. Marques-Silva. Using randomization and learning to solve hard real-world instances of satisfiability. In Principles and Practice of Constraint Programming, pages 489-494, 2000.
8. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.
9. R. J. J. Bayardo and R. C. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), pages 203- 208, Providence, Rhode Island, 1997.
10. D. L. Berre and L. Simon, 2005. SAT'05 Competition Homepage, http://www.satcompetition.org/2005/.
11. S. A. Cook and R. A. Reckhow. The relative efficiency of propositional proof systems. J. Symb. Log., 44(1):36-50, 1979.
12. P. Chatalic and L. Simon. ZRes: The old Davis-Putnam procedure meets ZBDDs. In D. McAllester, editor, 17th International Conference on Automated Deduction (CADE'17), number 1831, pages 449-454, 2000.
13. A. Darwiche. Recursive conditioning. Artificial Intelligence, 126(1- 2):5-41, 2001.
14. R. Davis. Diagnostic reasoning based on structure and behavior. Artif. Intell., 24(1-3):347-410, 1984.
15. R. Dechter. Learning while searching in constraint-satisfactionproblems. In AAAI, pages 178-185, 1986.
16. R. Dechter. Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artif. Intell., 41(3):273-312, 1990.
17. R. Dechter. Bucket elimination: A unifying framework for processing hard and soft constraints. Constraints: An International Journal, 2:51-55, 1997.
18. N. Dershowitz, Z. Hanna, and A. Nadel. A clause-based heuristic for sat solvers. In Proceedings of SAT 2005, pages 46-60, 2005.
19. N. Dershowitz, Z. Hanna, and A. Nadel. Towards a better understanding of the functionality of a conflict-driven sat solver. In Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing, 2005.
20. J. De Kleer and B. C. Williams. Diagnosing multiple faults. Artif. Intell., 32(1):97-130, 1987.
21. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, 1962.
22. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
23. R. Dechter and I. Rish. Directional resolution: The davis putnam procedure, revisited. In Principles of Knowledge Representation (KR-94), pages 134-145, 1994.
24. N. Éen and N. S̈orensson. An extensible sat-solver. In Proceedings of SAT'03, pages 502-518, 2003.
25. J. Franco, M. Kouril, J. Schlipf, J. Ward, S. Weaver, M. Dransfield, and W. M. Vanfleet. Sbsat: a state-based, bdd-based satisfiability solver. In Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, pages 398-410, 2004.
26. J. Gaschnig. A general backtrack algorithm that eliminates most redundant tests. In IJCAI, page 457, 1977.
27. M. R. Genesereth. The use of design descriptions in automated diagnosis. Artif. Intell., 24(1-3):411-436, 1984.
28. E. Goldberg and Y. Novikov. Berkmin: A fast and robust sat-solver. In DATE '02: Proceedings of the conference on Design, automation and test in Europe, page 142, Washington, DC, USA, 2002. IEEE Computer Society.
29. E. Goldberg and Y. Novikov. Verification of proofs of unsatisfiability for cnf formulas. In Proceedings of Design, Automation and Test in Europe (DATE2003)., 2003.
30. C. P. Gomes, B. Selman, and N. Crato. Heavy-tailed distributions in combinatorial search. In Principles and Practice of Constraint Programming, pages 121-135, 1997.
31. J. F. Groote and J. P. Warners. The propositional formula checker heerhugo. Journal of Automated Reasoning, 24:101-125, 2000.
32. J. Harrison. Stalmärck's algorithm as a hol derived rule. In Proceedings of TPHOLs'96, pages 221-234, 1996.
33. J. Huang and A. Darwiche. Toward good elimination orders for symbolic sat solving. In Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 566-573, 2004.
34. R. Hojati, S. C. Krishnan, and R. K. Brayton. Early quantification and partitioned transition relations. In ICCD '96: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors, pages 12-19, Washington, DC, USA, 1996. IEEE Computer Society.
35. J. Huang. A case for simple sat solvers. In CP, pages 839-846, 2007.
36. J. Huang. The effect of restarts on the efficiency of clause learning. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pages 2318-2323, 2007.
37. H. Jin and F. Somenzi. Circus : Hybrid satifiability solver. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), 2004.
38. C. M. Li. Integrating equivalency reasoning into davis-putnam procedure. In AAAI: 17th National Conference on Artificial Intelligence. AAAI / MIT Press, 2000.
39. J. Lang, P. Liberatore, and P. Marquis. Propositional independence: Formula-variable independence and forgetting. J. Artif. Intell. Res. (JAIR), 18:391-443, 2003.
40. P. Marquis. Consequence finding algorithms. Handbook on Defeasible Reasonging and Uncertainty Management Systems, Volume 5: Algorithms for Uncertain and Defeasible Reasoning, pages 41-145, 2000.
41. D. Motter and I. Markov. A compressed breadth-first search for satisfiability. In Proceedings of ALENEX 2002., 2002.
42. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. 39th Design Automation Conference (DAC), 2001.
43. J. P. Marques-Silva and K. Sakallah. Grasp: A search algorithm for propositional satisfiability. IEEE Trans. Computers, (5):506-521, 1999.
44. K. Pipatsrisawat and A. Darwiche. Rsat 2.0: Sat solver description. Technical Report D-153, Automated Reasoning Group, Computer Science Department, UCLA, 2007.
45. P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, (9(3)):268-299, August 1993.
46. G. Pan and M. Vardi. Symbolic techniques in satisfiability solving. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), 2004.
47. R. Ranjan, A. Aziz, R. Brayton, B. Plessier, and C. Pixley. Efficient bdd algorithms for fsm synthesis and verification. In Proceedings of IEEE/ACM International Workshop on Logic Synthesis, Lake Tahoe, USA, May 1995., 1995.
48. J. A. Robinson. A machine-oriented logic based on the resolution principle. J. ACM, 12(1):23-41, 1965.
49. L. Ryan. Efficient Algorithms for Clause-Learning SAT Solvers. Master's thesis, Simon Fraser University, 2004.
50. A. Sabharwal. Symchaff: A structure-aware satisfiability solver. In AAAI, pages 467-474, 2005.
51. C. Sinz and A. Biere. Extended resolution proofs for conjoining bdds. In CSR, pages 600-611, 2006.
52. T. Sang, P. Beame, and H. A. Kautz. Heuristics for fast exact model counting. In Proceedings of SAT'05, pages 226-240, 2005.
53. B. Selman, H. A. Kautz, and D. A. McAllester. Ten challenges in propositional reasoning and search. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), pages 50-54, 1997.
54. R. M. Stallman and G. J. Sussman. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, 9, October 1977.
55. G. Stälmarck and M. S̈aflund. Modeling and verifying systems and software in propositional logic. In B.K. Daniels, editor, Safety of Computer Control Systems, 1990 (SAFECOMP'90), 1990.
56. G. Stälmarck. System for determining propositional logic theorems by applying values and rules to triplets that are generated from boolean formula., 1994. United States Patent number 5,276,897; see also Swedish Patent 467 076.
57. H. J. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni- Vincentelli. Implicit state enumeration of finite state machines using bdd's. In Proceedings of IEEE International Conference on Computer-Aided Design (ICCAD-90)., pages 130-133, 1990.
58. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13(3):566-579, 1984.
59. A. Van Gelder. Extracting (easily) checkable proofs from a satisfiability solver that employs both preorder and postorder resolution. In AMAI, 2002.
60. A. Van Gelder. Combining preorder and postorder resolution in a satisfiability solver. In IEEE/ASL LICS Satisfiability Workshop, Boston, 2001.
61. F. Wideb̈ack. Stälmarck's notion of n-saturation. Technical Report NP-K-FW-200, Prover Technology AB, 1996.
62. L. Zhang and S. Malik. Validating sat solvers using an independent resolution-based checker: Practical implementations and other applications. In DATE '03: Proceedings of the conference on Design, Automation and Test in Europe, page 10880, Washington, DC, USA, 2003. IEEE Computer Society.
63. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in boolean satisfiability solver. In ICCAD, pages 279-285, 2001.