Average case results for satisfiability algorithms under the random-clause-width model

Annals of Mathematics and Artificial Intelligence

Volumn 20, Issue 1-4, 1997, Pages 357-391

  Franco, J ^a   Swaminathan, R P ^a  

^a University of Cincinnati   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031478062     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018992730285     Document Type: Article

References (25)

1. D. Angluin and L.G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Journal of Comput. Sys. Sci. 18 (1979) 155-193.
2. B.I. Apsvall, Efficient algorithms for certain satisfiability and linear programming problems, Ph.D. dissertation, Stanford University, Stanford, California (1980).
3. K. Bugrara, Y. Pan and P.W. Purdom, Exponential average time for the pure literal rule, SIAM J. Comput. 18 (1989) 409-418.
4. V. Chandru and J.N. Hooker, Extended Horn sets in propositional logic, J. ACM 38 (1991) 205-221.
5. M. Davis and H. Putnam, A computing procedure for quantification theory, J. ACM 7 (1960) 201-215.
6. M. Davis, G. Logemann and D. Loveland, A machine program for theorem proving, C. ACM 5 (1962) 394-397.
7. W.F. Dowling and J.H. Gallier, Linear time algorithms for testing the satisfiability of Horn formulae, J. Logic Prog. 3 (1984) 267-284.
8. J. Franco, On the occurrence of null clauses in random instances of satisfiability, Discrete Appl. Math. 41 (1993) 203-209.
9. J. Franco, Elimination of infrequent variables improves average case performance of satisfiability algorithms, SIAM Journal on Computing 20 (1991) 1119-1127.
10. J. Franco, Probabilistic analysis of algorithms for stuck-at test generation in PLAs, Lecture Notes in Control and Information Sciences 174 (1992) 56-75.
11. J. Franco and Y.C. Ho, Probabilistic analysis of a heuristic for the satisfiability problem, Discrete Applied Math. 22 (1988/1989) 35-51.
12. J. Franco and M. Paull, Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem, Discrete Appl. Math. 5 (1983) 77-87.
13. G. Gallo and G. Urbani, Algorithms for testing the satisfiability of propositional formulae, J. Logic Prog. 7 (1989) 45-61.
14. A. Goldberg, Average case complexity of the satisfiability problem, in: Proc. 4th Workshop on Automated Deduction (1979) pp. 1-6.
15. A. Goldberg, P.W. Purdom and C.A. Brown, Average time analysis of simplified Davis-Putnam procedures, Inform. Process. Lett. 15 (1982) 72-75.
16. K. Iwama, CNF satisfiability test by counting and polynomial average time, SIAM J. Comput. 18 (1989) 385-391.
17. A. Itai and J. Makowsky, On the complexity of Herbrand's theorem, Technical Report 243, Department of Computer Science, Israel Institute of Technology (1982).
18. H.R. Lewis, Renaming a set of clauses as a Horn set, J. ACM 25 (1978) 134-135.
19. P.W. Purdom, A survey of average time analysis of satisfiability algorithms, Journal of Information Processing 13 (1990).
20. P.W. Purdom, Search rearrangement backtracking and polynomial average time, Artificial Intelligence 21 (1983) 117-133.
21. P.W. Purdom and C.A. Brown, The pure literal rule and polynomial average time, SIAM J. Comput. 14 (1985) 943-953.
22. P.W. Purdom and C.A. Brown, Polynomial average time satisfiability problems, Inform. Sci. 41 (1987) 23-42.
23. P.W. Purdom and G.N. Haven, Backtracking and probing, Indiana University Technical Report No. 387 (1993).
24. J. Schlipf, F. Annexstein, J. Franco and R.P. Swaminathan, On finding solutions for extended Horn formulas, Information Processing Letters 54 (1995) 133-137.
25. R.P. Swaminathan and D.K. Wagner, The arborescence-realization problem, Discrete Applied Math. (to appear).