Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances

Annals of Mathematics and Artificial Intelligence

Volumn 44, Issue 1-2, 2005, Pages 157-177

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

^a Math Comp Sci Dept Software T ^*  (Netherlands)

Author keywords

3 SAT; Density; Horn; Satisfiability

Indexed keywords

EID: 17444411560     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-005-2369-1     Document Type: Article

References (19)

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 (1979) 121-123.
2. H. Bennaceur and C.M. Li, Characterizing SAT problems with the row convexity property, in: Principles and Practice of Constraint Programming - CP2002, ed. P. Van Hentenrijck (2002).
3. 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 (2002) 381-394.
4. B. Borchers and J. Furman, A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems, Journal of Combinatorial Optimization 2(4) (1999) 299-306.
5. E. Boros, Maximum renamable Horn sub-CNFs, Discrete Applied Mathematics 96-97 (1999) 29-40.
6. A. Braunstein, M. Mezard and R. Zecchina, SurveyPropagation: an algorithm for satisfiability, Preprint (2002).
7. S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971) pp. 151-158.
8. Y. Crama, O. Ekin and P.L. Hammer, Variable and term removal from boolean formulae, Discrete Applied Mathematics 75 (1997) 217-230.
9. W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming 1 (1984) 267-284.
10. O. Dubois and G. Dequen, A backbone-search heuristic for efficient solving of hard 3-SAT formulae, in: Proceedings of IJCAI-01 (2001).
11. E. Friedgut, Sharp thresholds of graph properties and the k-SAT problem, Journal of the American Mathematical Society 12(4) (1999) 1017-1054.
12. M.R. Garey, D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theory of Computer Science 1 (1976) 237-267.
13. E.A. Hirsch and A. Kojevnikov, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, in: Electronic Proceedings of SAT-2002 (2002).
14. O. Kullmann, Investigating the behaviour of a SAT solver on random formulas, Annals of Mathematics and Artificial Intelligence (2002).
15. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky, Determining computational complexity from characteristic 'phase transitions', Nature 400 (1999) 133-137.
16. N. Nishimura, P. Ragde and S. Szeider, Detecting backdoor sets with respect to Horn and binary clauses, in: Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (2004).
17. S. Porschen and E. Speckenmeyer, Worst case bounds for some NP-complete modified Horn-SAT problems, in: Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (2004).
18. H. van Maaren and L. van Norden, Hidden threshold phenomena for fixed-density SAT-formulae, in: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003, Selected Revised Papers, eds. E. Giunchiglia and A. Tacchella, Lecture Notes in Computer Science, Vol. 2919 (2004) pp. 135-149.
19. H. van Maaren and J.P. Warners, Solving satisfiability problems using elliptic approximations. A note on volumes and weights, Annals of Mathematics and Artificial Intelligence 37 (2003) 273-283.