On generating all solutions of generalized satisfiability problems

Theoretical Informatics and Applications

Volumn 31, Issue 6, 1997, Pages 499-511

  Creignou, N ^a   Hebrard, J J ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031351161     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1997310604991     Document Type: Article

References (12)

1. B. ASPVALL, M. F. PLASS and R. E. TARJAN, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, 1979, 8, (3), pp. 121-123.
2. S. A. COOK, The complexity of theorem-proving procedures. In Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.
3. N. CREIGNOU and M. HERMANN, Complexity of Generalized Satisfiability Counting Problems, Information and Computation, 1996, 125, (1), pp. 1-12.
4. W. F DOWLING and J. H. GALLIER, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming, 1984, 3, pp. 267-284.
5. M. R. GAREY and D. S. JOHNSON, Computers and intractability: A guide to the theory of NP-completeness, W. H. Freeman and Co, 1979.
6. P. HELL and J. NEŠETŘIL, On the complexity of H-coloring, Journal of Combinatorial Theory, Series B, 1990, 48, pp. 92-110.
7. A. HORN, On sentences which are true of direct unions of algebras, Journal of Symbolic Logic, 1951, 16, pp. 14-21.
8. D. S. JOHNSON, M. YANNAKAKIS and C. H. PAPADIMITRIOU, On generating all maximal independent sets, Information Processing Letters, 1988, 27, pp. 119-123.
9. R. E. LADNER, On the structure of polynomial time reducibility, Journal of the Association for computing Machinery, 1975, 22, pp. 155-171.
10. A. K. MACKWORTH, Constraint Satisfaction, in S. C. Shapiro, ed., The encyclopedia of Artificial Intelligence, Wiley, New York, 1992, pp. 285-293.
11. T. J. SCHAEFER, The complexity of satisfiability problems. In Proceedings 10th STOC, San Diego (CA, USA), Association for Computing Machinery, 1978, pp. 216-226.
12. L. G. VALIANT, The complexity of enumeration and reliability problems, SIAM Journal on Computing, 1979, 8, (3), pp. 410-421.