Resolution for quantified boolean formulas

Information and Computation

Volumn 117, Issue 1, 1995, Pages 12-18

  Büning, Hans Kleine ^a   Karpinski, Marek ^b   Flögel, Andreas ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002037968     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1995.1025     Document Type: Article

References (6)

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, 121-123.
2. Dowling, W. F., and Gallier, J. H. (1984), Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 3, 267-284.
3. Garey, M. R., and Johnson, D. S. (1979), "Computers and Intractability, A Guide to the Theory of NP-Completeness," Freeman, San Francisco.
4. Haken, A. (1985), The intractability of resolution, Theoret. Comput. Sci. 39, 297-308.
5. Karpinski, M., Kleine Buning, H., and Schmitt, P. H. (1987), On the computational complexity of quantified Horn clauses, in "Proceedings, CSL '87," Lecture Notes in Computer Science, Vol. 329, pp. 129-137, Springer-Verlag, Berlin/New York.
6. Stockmeyer, L. J., and Meyer, A. R. (1973), Word problems requiring exponential time, in "Proceedings, 5th Annual ACM Symposium on Theory of Computing," pp. 1-9.