Hidden threshold phenomena for fixed-density SAT-formulae

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

Volumn 2919, Issue , 2004, Pages 135-149

  Van Maaren, Hans ^a   Van Norden, Linda ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

3 SAT; Graph 3 coloring; Horn; Satisfiability; Thresholds

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

3-SAT; EXPERIMENTAL EVIDENCE; HORN; SATISFIABILITY; THRESHOLD PHENOMENA; THRESHOLDS;

FORMAL LOGIC;

EID: 35048816943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_11     Document Type: Article

References (14)

1. B. Aspvall, M.F. Plass, and R.E. Tarjan. A linear time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters, 8:121-123, 1979.
2. G. Biroli, S. Cocco, and R. Monasson. Phase transitions and complexity in computer science: an overview of the statistical physics approach to the random satisfiability problem. Physica A, 306:381-394, 2002.
3. E. Boros. Maximum renable horn sub-CNFs. Discrete Applied Mathematics, 96-97:29-40, 1999.
4. V. Chandru and J.N. Hooker. Detecting embedded horn structure in prepositional logic. Information Processing Letters, 42:109-111, 1992.
5. S.A. Cook. The complexity of theorem proving procedures. In Proceedings of the 3rd annual ACM symposium on the Theory of Computing, pages 151-158, 1971.
6. Y. Crama, O. Ekin, and P.L. Hammer. Variable and term removal from boolean formulae. Discrete Applied Mathematics, 75:217-230, 1997.
7. W.F. Dowling and J.H. Gallier. Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 1:267-284, 1984.
8. O. Dubois and G. Dequen. A backbone-search heuristic for efficient solving of hard 3-sat formulae. IJCAI-01, 2001.
9. J. Franco. Relative size of certain polynomial time solvable subclasses of satisfiability, volume 35 of DIMACS Series Discrete Math. Theoret. Computer Science, pages 211-233. Amer.Math.Soc., Piscataway, NJ, 1997.
10. E. Friedgut. Sharp thresholds of graph proporties and the k-sat problem. Journal of the American Mathematical Society, 12(4):1017-1054, 1999.
11. O. Kullmann. First report on an adaptive density based branching rule for DLL-like SAT-solvers, using a database of mixed random conjunctive normal forms created using the advanced encryption standard (aes). Technical Report CSR 19-2002, University of Wales Swansea, Computer Science Report Series, 2002.
12. O Kullmann. Investigating the behaviour of a sat solver on random formulas. Submitted to Annals of Mathematics and Artificial Intelligence, 2002.
13. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic 'phase transitions'. Nature, 400:133-137, July 1999.
14. H. Van Maaren and C. Dang. Simplicial pivoting algorithms for a tractable class of integer programs. Journal of Combinatorial Optimization, 6:133-142, 2002.