A perspective on certain polynomial-time solvable classes of satisfiability

Discrete Applied Mathematics

Volumn 125, Issue 2-3, 2003, Pages 177-214

  Franco, John ^a   Van Gelder, Allen ^b  

^a UNIVERSITY OF CINCINNATI   (United States)

^b University of California Santa Cruz   (United States)

Author keywords

Matching; NP complete; Probabilistic analysis; Random CNF formulas; Satisfiability

Indexed keywords

FORMAL LOGIC; PROBABILITY;

CNF FORMULAS; MATCHING; NP COMPLETE; PROBABILISTIC ANALYSIS; SATISFIABILITY;

POLYNOMIAL APPROXIMATION;

EID: 0037289978     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00358-4     Document Type: Article

References (41)

1. M. Abramowitz, and I.A. Stegun Handbook of Mathematical Functions 1972 Dover Publications New York
2. R. Aharoni, and N. Linial Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas J. Combin. Theory Ser. A 43 1986 196 204
3. N. Alon, and J.H. Spencer The Probabilistic Method 1992 Wiley New York
4. B. Aspvall, M.F. Plass, and R.E. Tarjan A linear-time algorithm for testing the truth of certain quantified Boolean formulas Inform. Process. Lett. 8 1979 121 132
5. B. Aspvall Recognizing disguised NR(1) instances of the satisfiability problem J. Algorithms 1 1980 97 103
6. P. Beame, R. Karp, T. Pitassi, M. Saks, On the complexity of unsatisfiability proofs for random formulas, in: Proceedings of 30th Annual ACM Symposium on Theory of Computing, ACM, New York, 1998.
7. B. Bollobas Random Graphs 1985 Academic Press London
8. E. Boros, P.L. Hammer, and X. Sun Recognition of q-Horn formulae in linear time Discrete Appl. Math. 55 1994 1 13
9. E. Boros, Y. Crama, P.L. Hammer, and M. Saks A complexity index for satisfiability problems SIAM J. Comput. 23 1994 45 49
10. A.Z. Broder, A.M. Frieze, E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas, in: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, 1993, pp. 322-330. (Pubitemid 23612714)
11. H. Kleine Büning, On the minimal unsatisfiability problem for some subclasses of CNF, in: Abstracts of 16th International Symposium on Mathematical Programming, Mathematical Programming Society, 1997.
12. V. Chandru, and J.N. Hooker Extended Horn sets in propositional logic J. ACM 38 1991 205 221
13. M.T. Chao, and J. Franco Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiable problem Inform. Sci. 51 1990 289 314 (Pubitemid 20735615)
14. V. Chvátal, B. Reed, Mick gets some (the odds are on his side), in: Proceedings 32nd Symposium on the Foundations of Computer Science, IEEE, New York, 1992.
15. V. Chvátal, and E. Szemerédi Many hard examples for resolution J. ACM 35 1988 759 770
16. M. Conforti, G. Cornuéjols, A. Kapoor, K. Vušković, M.R. Rao, Balanced matrices, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming: State of the Art (Braun-Brumfield, United States, 1994), Produced in association with the 15th International Symposium on Mathematical Programming, University of Michigan, 1994.
17. M. Dalal, and D.W. Etherington A hierarchy of tractable satisfiability problems Inform. Process. Lett. 44 1992 173 180
18. W.F. Dowling, and J.H. Gallier Linear-time algorithms for testing the satisfiability of propositional Horn formulae J. Logic Programming 1 1984 267 284
19. S. Even, A. Itai, and A. Shamir On the complexity of timetable and multi-commodity flow problems SIAM J. Comput. 5 1976 691 703
20. J. Franco, Relative size of certain polynomial time solvable subclasses of satisfiability, in: D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications, DIMACS Workshop, March 1996, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 1997, pp. 211-223.
21. J. Franco, and M. Paull Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem Discrete Appl. Math. 5 1983 77 87
22. J. Franco, A. Van Gelder, A perspective on certain polynomial-time solvable classes of satisfiability, in: Abstracts of 16th International Symposium on Mathematical Programming, Lausanne, 1997.
23. A.M. Frieze, and S. Suen Analysis of two simple heuristics on a random instance of k-SAT J. Algorithms 20 1996 312 355 (Pubitemid 126412188)
24. X. Fu, On the Complexity of proof systems, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1995.
25. A. Goerdt, A threshold for unsatisfiability, J. Comput. System Sci. 53 (1996) 469-486. (Preliminary version in Proc. MFCS, Prague, 1992, LNCS 692.) (Pubitemid 126653479)
26. P. Hall On representatives of subsets J. London Math. Soc. 10 1935 26 30
27. A. Itai, J. Makowsky, On the complexity of Herbrand's theorem, Working paper 243, Department of Computer Science, Israel Institute of Technol., 1982.
28. R.A. Kowalski A proof procedure using connection graphs J. ACM 22 1974 572 595
29. O. Kullmann, Investigations on autark assignments, Discrete Appl. Math. 107 (2000) 99-137.
30. H.R. Lewis Renaming a set of clauses as a Horn set J. ACM 25 1978 134 135
31. H. van Maaren A short note on some tractable cases of the satisfiability problem Information and Control 158 2000 125 130
32. T.S. Schaefer, The complexity of satisfiability problems, in: Proceedings of Tenth Annual ACM Symposium on Theory of Computing, ACM, New York, 1978, pp. 216-226.
33. J.S. Schlipf, F. Annexstein, J. Franco, and R.P. Swaminathan On finding solutions for extended Horn formulas Inform. Process. Lett. 54 1995 133 137
34. M.G. Scutella A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability J. Logic Programming 8 1990 265 273
35. C.A. Tovey A simplified NP-complete satisfiability problem Discrete Appl. Math. 8 1984 85 89
36. K. Trümper Effective Logic Computation 1998 Wiley New York
37. A. Van Gelder, and Y.K. Tsuji Satisfiability testing with more reasoning and less guessing D.S. Johnson, M. Trick, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge 1996 American Mathematical Society Providence, RI
38. H. Kleine Büning, On generalized Horn formulas and k resolution, Theoret. Comput. Sci. 116 (1993) 405-413.
39. J. Franco, J. Goldsmith, J.S. Schlipf, E. Speckenmeyer, R.P. Swaminathan, An algorithm for the class of pure implicational formulas, in: Proceedings of the Workshop on Satisfiability, Siena, Italy, 1996.
40. G. Gallo, D. Pretolani, Hierarchies of polynomially solvable SAT problems, in: Proceedings of the Third International Symposium on AI & Mathematics, Fort Lauderdale, Florida, 1994.
41. G. Gallo, M.G. Scutella, Polynomially solvable satisfiability problems, Inform. Process. Lett. 29 (1988) 221-227.