Redundancy in Random SAT Formulas

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 273-278

  Boufkhad, Yacine ^a   Roussel, Olivier ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

PERFORMANCE; PROPERTY; RANDOM INSTANCE; SAT MODEL; SATISFIABILITY ALGORITHMS; TESTING ALGORITHM;

REDUNDANCY;

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

References (15)

1. Bayardo, R. J., and Schrag, R. 1996. Using CSP look-back techniques to solve exceptionally hard SAT instances. In Springer., ed., Proc. of the Second Int'l Conf. on Principles and Practice of Constraint Programming, 46-60.
2. Boufkhad, Y. 1996. Aspects Probabilistes et Algorithmiques du Problème de Satisfiabilité. Ph.D. Dissertation, Université Paris 6.
3. Crawford, J. M., and Auton, L. 1996. Experimental Results on the Crossover Point in Random 3-SAT. Artificial Intelligence 81.
4. Davis, M., and Putnam, H. 1960. A computing Procedure for Quantification Theory. Jour. Assoc. for Comput. Mach. 7:201-215.
5. Davis, M.; Logemann, G.; and Loveland, D. 1962. A Machine Program for Theorem Proving. Jour. Assoc. for Comput. Mach. 5:267-270.
6. Dubois, O.; André, P.; Boufkhad, Y.; and Carlier, J. 1996. SAT versus UNSAT. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, number 26. American Mathematical Society. 415-436.
7. Freeman, J. W. 1995. Improvements to Propositional Satisfiability Search Algorithms. Ph.D. Dissertation, University of Pennsylvania, Philadelphia.
8. Gent, I. P., and Walsh, T. 1993. Easy Problems are Sometimes Hard. Artificial Intelligence 70:335-345.
9. Hogg, T., and Williams, C. 1994. The Hardest Constraint Problems: A Double Phase Transition. Artificial Intelligence 69:359-377.
10. Larabee, T., and Tsuji, Y. 1993. Evidence for a Satisfiability Threshold for Random 3CNF Formulas. In Proceedings AAAI Spring Symposium, 112-118.
11. LI, C. M., and Anbulagan. 1997. Heuristics Based on Unit Propagation for Satisfiability Problems. In Proceedings of IJCAI'97, 366-371.
12. Mazure, B.; Saïs, L.; and Grégoire, E. 1996. Detecting Logical Inconsistencies. In Annals of Mathematics and Artificial Intelligence.
13. McAllester, D.; Selman, B.; and Kautz, H. 1997. Evidence for Invariants in Local Search. In Proceedings of the Fourteenth National Conference on Artificial Intelligence AAAI'97.
14. Mitchell, D.; Selman, B.; and Levesque, H. 1992. Hard and Easy Distribution of SAT Problems. In Proceedings of AAAI'92, 459-465.
15. Schrag, R., and Crawford, J. M. 1996. Implicates and Prime Implicates in Random 3SAT. Artificial Intelligence 81:199-222.