A short note on some tractable cases of the satisfiability problem

Information and Computation

Volumn 158, Issue 2, 2000, Pages 125-130

  Van Maaren, Hans ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Autarkies; Complexity; Horn; Satisfiability

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; POLYNOMIALS; VECTORS;

SATISFIABILITY PROBLEM;

COMPUTER SCIENCE;

EID: 0034191843     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2867     Document Type: Article

References (15)

1. Aspvall, B., Plass, M. F., and Tarjan, R. E. (1979), A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inform. Process. Lett. 8(3), 121-123.
2. Boros, E., Crama, Y., Hammer, P. L., and Saks, M. (1994), A complexity index for satisfiability problems, SIAM J. Comput. 23, 45-49.
3. Boros, E., Hammer, P. L., and Sun, X. (1994), Recognition of q-Horn formulae in linear time, Discrete Appl. Math. 55, 1-13.
4. Chandru, V., and Hooker, J. N. (1991), Extended Horn sets in propositional logic, J. Assoc. Comput. Mach 38, 205-221.
5. Conforti, M., and Cornuéjols, G. (1995), A class of logic problems solvable by linear programming, J. Assoc. Comput. Mach. 42, 1107-1113.
6. Dowling, W. F., and Gallier, J. H. (1984), Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 1, 267-284.
7. Du, D., Gu, J., and Pardalos, P. M. (1996), Satisfiability problem: theory and applications, Papers from the DIMACS Workshop held at Rutgers University, Piscataway, NJ.
8. Franco, J. (1997), Relative size of certain polynomial time subclasses of satisfiability, in "Satisfiability problem: theory and applications (Piscataway, NJ, 1996)," pp. 211-223, Amer. Math. Soc., Providence, RI.
9. Kullmann, O. Investigations on autark assignments, submitted.
10. Lewis, H. R. (1978), Renaming a set of clauses as a Horn set, J. Assoc. Comput. Mach 25, 134-135.
11. n steps, Discrete Appl. Math. 10, 287-295.
12. Schlipf, J. S., Annexstein, F. S., Franco, J. V., and Swaminathan, R. P. (1995), On finding solutions for extended Horn formulas, Inform. Process. Lett. 54(3) 133-137.
13. Scutellà, M. G. (1990), A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability, J. Logic Programming 8, 265-273.
14. Truemper, K. (1982), Alpha-balanced graphs and matrices and gf(3)-representability of matroids, J. Combin. Theory Ser. B 32, 112-139.
15. Warners, J., and van Maaren, H. (in press), Solving satisfiability problems using elliptic approximations; effective branching rules, Discrete Appl. Math.