Variable and term removal from Boolean formulae

Discrete Applied Mathematics

Volumn 75, Issue 3, 1997, Pages 217-230

  Crama, Yves ^a   Ekin, Oya ^b   Hammer, Peter L ^b  

^a UNIVERSITY OF LIÈGE   (Belgium)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17444362867     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00028-5     Document Type: Article

References (15)

1. E. Boros, Y. Crama and P.L. Hammer, Polynomial-time inference of all valid implications for Horn and related formulae, Ann. Math. Artificial Intelligence 1 (1990) 21-32.
2. E. Boros, Y. Crama, P.L. Hammer and M. Saks, A complexity index for satisfiability problems, SIAM J. Comput. 23 (1994) 45-49.
3. E. Boros, P.L. Hammer and X. Sun, Recognition of q-Horn formulae in linear time, Discrete Appl. Math. 55 (1994) 1-13.
4. R.K. Brayton, G.D. Hachtel, C.T. McMullen and A.L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis (Kluwer, Dordrecht, 1984).
5. M. Buro and H. Kleine Büning, Report on a SAT competition, Technical Report 'Informatik Nr. 110', Universität Paderborn, 1992.
6. V. Chandru and J.N. Hooker, Detecting embedded Horn structure in propositional logic, Inform. Process. Lett. 42 (1992) 109-111.
7. G. Gallo and G. Urbani, Algorithms for testing the satisfiability of propositional formulae, J. Logic Programming 7 (1989) 45-61.
8. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
9. M.R. Garey, D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Comput. Sci. 1 (1976) 237-267.
10. P.L. Hammer and S. Rudeanu, Boolean Methods in Operations Research (Springer, Berlin, 1968).
11. H.R. Lewis, Renaming a set of clauses as a Horn set. J. ACM 25 (1978) 134-135.
12. J.M. Lewis and M. Yannakakis, The node-deletion problem for hereditary properties is NP-complete, J. Comput. System Sci. 20 (1980) 219-230.
13. S. Muroga, Threshold Logic and its Applications (Wiley-Interscience, New York, 1971).
14. K. Truemper, Monotone decomposition of matrices, Technical Report UTDCS-1-94, 1994.
15. M. Yannakakis, Node- and edge-deletion NP-complete problems. Proceedings of Tenth Annual ACM Symposium on Theory of Computing (1978) 253-264.