Maximum renamable Horn sub-CNFs

Discrete Applied Mathematics

Volumn 96-97, Issue , 1999, Pages 29-40

  Boros, Endre ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Horn CNF; Satisfiability

Indexed keywords

EID: 0007133087     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00031-1     Document Type: Article

References (27)

1. N. Alon, J.H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992, pp. 14-23.
3. B. Aspvall, Recognizing disguised NR(1) instances of the satisfiability problem, J. Algorithms 1 (1980) 97-103.
4. B. Aspvall, M.F. Plass, R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formula, Inform. Process. Lett. 8 (1979) 121-123.
5. E. Boros, Y. Crama, P.L. Hammer, Polynomial-time inference of all valid implications for Horn and related formulae, Ann. Math. Artif. Intell. 1 (1990) 21-32.
6. E. Boros, Y. Crama, P.L. Hammer, M. Saks, A complexity index for satisfiability problems, SIAM J. Comput. 23 (1994) 45-49.
7. E. Boros, P.L. Hammer, X. Sun, Recognition of q-Horn formulae in linear time, Discrete Appl. Math. 55 (1994) 1-13.
8. E. Boros, A. Prékopa, Probabilistic bounds and algorithms for the maximum satisfiability problem, Ann. Oper. Res. 21 (1989) 109-126.
9. M. Buro, H. Kleine Büning, Report on a SAT competition, Technical Report 'Informatik Nr. 110', Universität Paderborn, 1992.
10. V. Chandru, C.R. Coullard, P.L. Hammer, M. Montanez, X. Sun, On renamable Horn and generalized Horn Functions, Ann. Math. Artif. Intell. 1 (1990) 33-47.
11. V. Chandru, J.N. Hooker, Extended Horn sets in prepositional logic, J. Assoc. Comput. Mach. 38 (1991) 205-221.
12. V. Chandru, J.N. Hooker, Detecting embedded Horn structure in propositional logic, Inform. Process. Lett. 42 (1992) 109-111.
13. S.A. Cook, The complexity of theorem proving procedures, Proceedings of the Third Annual Symposium on Theory of Computing, 1971, pp. 151-158.
14. Y. Crama, O. Ekin, P.L. Hammer, Variable and term removal from Boolean formulae, RUTCOR Research Report 26-95, Rutgers University, 1995.
15. W.F. Dowling, J.H. Gallier, Linear time algorithms for testing the satisfiability of Horn formulae, J. Logic Programming 1 (1984) 267-284.
16. S. Even, A. Itai, A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput. 5 (1976) 691-703.
17. U. Feige, M. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, Proceedings of the Third Israel Symposium on Theory of Computing and Systems, Tel Aviv, Israel, 1995, pp. 182-189.
18. G. Gallo, M.G. Scutellà, Polynomially solvable satisfiability problems, Inform. Process. Lett. 29 (1988) 221-227.
19. G. Gallo, G. Urbani, Algorithms for testing the satisfiability of propositional formulae, J. Logic Programm. 7 (1989) 45-61.
20. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
21. M.X. Goemans, D.P. Williamson, New 3/4-approximation algorithms for the maximum satisfiability problem, SIAM J. Discrete Math. 7 (1994) 656-666.
22. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 422-431.
23. A. Itai, J.A. Makowsky, Unification as a complexity measure for logic programming, J. Logic Programming 4 (1987) 105-117.
24. N.D. Jones, W.T. Laaser, Complete problems for deterministic polynomial time, Theoret. Comput. Sci. 3 (1977) 105-117.
25. H.R. Lewis, Renaming a set of clauses as a Horn set, J. Assoc. Comput. Mach. 25 (1978) 134-135.
26. P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, J. Comput. System. Sci. 37 (1988) 130-143.
27. K. Truemper, Monotone decomposition of matrices, Technical Report, UTDCS-1-94, 1994.