Recognition of tractable satisfiability problems through balanced polynomial representations

Discrete Applied Mathematics

Volumn 99, Issue 1-3, 2000, Pages 229-244

  Warners, Joost P ^a,b   Van Maaren, Hans ^a  

^a DelftUnivTechnol KatholiekeUniv   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Conjunctive normal form; Polynomial functions; Polynomial time algorithm; Satisfiability

Indexed keywords

EID: 0347685849     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00135-3     Document Type: Article

References (20)

1. Aspvall B., Plass M.F., Tarjan R.E. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inform. Process. Lett. 8(3):1979;121-123.
2. B. Benhamou, L. Sais, Theoretical study of symmetries in propositional calculus and applications, in: Proceedings of the 11th Conference on Automated Deduction, 1992, pp. 281-294.
3. Boros E., Crama Y., Hammer P.L., Saks M. A complexity index for satisfiability problems. SIAM J. Comput. 23:1992;45-49.
4. Chandru V., Coullard C.R., Hammer P.L., Montanez M., Sun X. On renamable Horn and generalized Horn functions. Ann. Math. Artif. Intell. 1:1990;33-47.
5. Chandru V., Hooker J.N. Extended Horn sets in propositional logic. J. Assoc. Comput. Mach. 38:1991;205-221.
6. S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the third annual ACM symposium on the Theory of Computing, 1971, pp. 151-158.
7. Dowling W.F., Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Program. 1(3):1984;267-284.
8. O. Dubois, Lecture held at DIMACS conference, Rutgers University, New Brunswick, NJ, March 1996.
9. O. Dubois, P. Andre, Y. Boufkhad, J. Carlier, SAT versus UNSAT, in: Johnson and Trick (Eds.), Cliques, Coloring and Satisfiability: Second DIMACS implementation challenge, vol. 26 of DIMACS series in Discrete Mathematics and Computer Science. American Mathematical Society, Providence, RI, 1996, pp. 415-436.
10. Gallo G., Scutellá M.G. Polynomially solvable satisfiability problems. Inform. Process. Lett. 29:1988;221-227.
11. Gu J. Global optimization for satisfiability (SAT) problem. IEEE Trans. Knowledge Data Eng. 6(3):1994;361-381.
12. D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability: Second DIMACS implementation challenge, vol. 26 of DIMACS series in Discrete Mathematics and Computer Science. American Mathematical Society, Providence, RI, 1996.
13. H. Van Maaren, Elliptic approximations of propositional formulae, Technical Report 96-65, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands, 1996.
14. H. Van Maaren, On the use of second order derivatives for the satisfiability problem, in: D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability problem: Theory and applications, vol. 35 of DIMACS series in Discrete Mathematics and Computer Science, American Mathematical Society, Providence, RI, 1997, pp. 677-687.
15. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings of the Tenth Symposium on the Theory of Computing, 1978, pp. 216-226.
16. G.S. Tseitin, On the complexity of derivation in propositional calculus, Studies in Constructive Mathematics and Mathematical Logic Part 2 (1968) 115-125. Reprinted in J. Siekmann, G. Wrightson (Eds.), Automation of Reasoning, vol. 2, Springer, Berlin, 1983.
17. G.S. Tseitin, On the complexity of derivation in propositional calculus, Studies in Constructive Mathematics and Mathematical Logic Part 2 (1968) 115-125. Reprinted in J. Siekmann, G. Wrightson (Eds.), Automation of Reasoning, vol. 2, Springer, Berlin, 1983.
18. Urquhart A. Hard examples for resolution. J. ACM. 34:1987;209-219.
19. J.P. Warners, H. Van Maaren, Solving satisfiability problems using elliptic approximations - Effective branching rules, Technical Report 98-18, Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands, 1998, accepted for publication in Discr. Appl. Math.
20. Warners J.P., Van Maaren H. A two-phase algorithm for solving a class of hard satisfiability problems. Oper. Res. Lett. 23(3-5):1999;81-88.