Eliminating redundancies in SAT search trees

Proceedings of the International Conference on Tools with Artificial Intelligence

Volumn , Issue , 2003, Pages 100-104

  Ostrowski, Richard ^a   Mazure, Bertrand ^a   Saïs, Lakhdar ^a   Grégoire, Éric ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Boolean search and satisfiability; Davis and Putnam's algorithm; SAT

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; ONLINE SEARCHING; PROBLEM SOLVING; REDUNDANCY; TREES (MATHEMATICS);

CONFLICT ANALYSIS; PROPOSITIONAL SATISFIABILITY (SAT);

ARTIFICIAL INTELLIGENCE;

EID: 0345097623     PISSN: 10636730     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. R. J. Bayardo Jr. 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, USA), July 1997.
2. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using sat procedures instead of bdds. In Design Automaton Conference, DAC'99, 1999.
3. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the Third Annual ACM Symposium on Theory of Computing, pages 151-158, New York (USA), 1971.
4. J. Crawford and A. Baker. Experimental results on the application of satisfiability algorithms to scheduling problems. In Twelfth National Conference on Artificial Intelligence, AAAI'94, 1994.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the Association for Computing Machinery, 5:394-397, 1962.
6. Dimacs. Second Challenge on Satisfiability Testing organized by the Center for Discrete Mathematics and Computer Science of Rutgers University, 1993. http://dimacs.rutgers.edu/Challenges/.
7. O. Dubois and G. Dequen. A backbone-search heuristic for efficient solving of hard 3-sat formulae. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), volume 1, pages 248-253, Seattle, Washington (USA), Aug. 4-10 2001.
8. G. G. Gallo and G. Urbani. Algorithms for testing the satisfiability of propositional formulae. Journal of Logic Programming, 7(1):45-61, July 1989.
9. C. P. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proceedings of the 15th National Conference on Artificial Intelligence, (AAAI'98), pages 431-437, 1998.
10. H. H. Hoos and T. Stützte. The satisfiability library (satlib). http://www.intellektik.informatik.tudarmstadt.de/SATLIB/.
11. H. Kautz and B. Selman. Planning as satisfiability. In European Conference on Artificial Intelligence (ECAI'92), pages 359-363, Vienna, Austria, 1992.
12. T. Larrabee. Efficient generation of test patterns unsing boolean satisfiability. IEEE Transaction on CAD, 11:4-15, 1992.
13. F. Massacci and L. Marraro. Logical cryptanalysis as a sat-problem: Encoding and analysis of the u.s. data encryption standard. Journal of Automated Reasoning, 2000.
14. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), 2001.
15. R. Ostrowski, E. Grégoire, B. Mazure, and L. Sais. Recovering and exploiting structural knowledge from cnf formulas. In Proc. of the Eighth International Conference on Principles and Practice of Constraint Programming (CP'2002), pages 185-199, Ithaca (N.Y.), September 2002. LNCS 2470, Springer Verlag.
16. P. W. Purdom. Solving satisfiability with less searching, IEEE transactions on pattern analysis and machine intelligence, PAMI-6(4):510-513, July 1984.
17. R. Reiter and A. Mackworth. A logical framework for depiction and image interpretation. Artificial Intelligence, 43(2): 125-155, 1989.
18. O. Shtrichman. Tuning SAT checkers for bounded model checking. In Computer Aided Verification, pages 480-494, 2000.
19. J. P. M. Silva and K. A. Sakallah. Grasp - a new search algorithm for satisfiability. In IEEE/ACM International Conference on Computer-Aided Design, November 1996.
20. J. P. M. Silva and K. A. Sakallah. Boolean satisfiability in electronic design automation. In Proceedings of the IEEE/ACM Design Automation Conference, DAC'00, June 2000.
21. H. Zhang and J. Hsiang. Solving open quasigroup problems by prepositional reasoning. In International Computer Symposium, Hsinchu, Taiwan, 1994.