Satisfiability checking of non-clausal formulas using general matings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4121 LNCS, Issue , 2006, Pages 75-89

  Jain, Himanshu ^a   Bartzis, Constantinos ^a   Clarke, Edmund ^a  

^a School of Computer Science Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; LEARNING SYSTEMS; MATHEMATICAL OPERATORS; SEARCH ENGINES;

GENERAL MATINGS; NON-CHRONOLOGICAL BACKTRACKING; NON-CLAUSAL FORMULAS; SEARCH SPACE PRUNING;

PROBLEM SOLVING;

EID: 33749543730     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. Edimacs format, www.satcompetition.org/2005/edimacs.pdf.
2. Minisat sat solver, http://www.cs.chalmers.se/cs/research/formalmethods/ minisat/.
3. SatMate website, http://www.cs.cmu.edu/~modelcheck/satmate.
4. Siege (version 4) sat solver, http://www.cs.sfu.ca/~loryan/personal/.
5. TPS and ETPS, http://gtps.math.cmu.edu/tps-papers.html.
6. Peter B. Andrews. Theorem Proving via General Matings. J. ACM, 28(2):193-214, 1981.
7. Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: to Truth through Proof. Kluwer Academic Publishers, Dordrecht, second edition, 2002.
8. Wolfgang Bibel. On Matrices with Connections. J. ACM, 28(4):633-645, 1981.
9. M. K. Ganai, P. Ashar, A. Gupta, L. Zhang, and S. Malik. Combining Strengths of Circuit-based and CNF-based Algorithms for a High-performance SAT solver. In DAC, 2002.
10. E. Goldberg and Y. Novikov. BerkMin: A Fast and Robust Sat-Solver. In DATE, 2002.
11. Joao P. Marques-Silva and Karem A. Sakallah. GRASP - A New Search Algorithm for Satisfiability. In ICCAD, pages 220-227, 1996.
12. David McAllester, Bart Selman, and Henry Kautz. Evidence for invariants in local search. In AAAI, pages 321-326, Providence, Rhode Island, 1997.
13. Andreas Meier and Volker Sorge. A new set of algebraic benchmark problems for sat solvers. In SAT, pages 459-466, 2005.
14. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In DAC, pages 530-535, June 2001.
15. David A. Plaisted and Steven Greenbaum. A structure-preserving clause form translation. J. Symb. Comput., 2(3), 1986.
16. R. M. Smullyan. First Order Logic. Springer-Verlag, 1968.
17. Christian Thiffault, Fahiem Bacchus, and Toby Walsh. Solving Non-clausal Formulas with DPLL Search. In SAT, 2004.
18. H. Zhang. Sato: An efficient prepositional proven In CADE-14, pages 272-275, 1997.
19. Lintao Zhang, Conor F. Madigan, Matthew W. Moskewicz, and Sharad Malik. Efficient conflict driven learning in boolean satisfiability solver. In ICCAD, pages 279-285, 2001.