On generating all solutions of generalized satisfiability problems
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 6, pp. 499-511. 
@article{ITA_1997__31_6_499_0,
     author = {Creignou, N. and Hebrard, J.-J.},
     title = {On generating all solutions of generalized satisfiability problems},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {499--511},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {6},
     year = {1997},
     mrnumber = {1607518},
     zbl = {0901.68075},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1997__31_6_499_0/}
}
TY  - JOUR
AU  - Creignou, N.
AU  - Hebrard, J.-J.
TI  - On generating all solutions of generalized satisfiability problems
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1997
SP  - 499
EP  - 511
VL  - 31
IS  - 6
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1997__31_6_499_0/
LA  - en
ID  - ITA_1997__31_6_499_0
ER  - 
%0 Journal Article
%A Creignou, N.
%A Hebrard, J.-J.
%T On generating all solutions of generalized satisfiability problems
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1997
%P 499-511
%V 31
%N 6
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1997__31_6_499_0/
%G en
%F ITA_1997__31_6_499_0
Creignou, N.; Hebrard, J.-J. On generating all solutions of generalized satisfiability problems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 6, pp. 499-511. http://archive.numdam.org/item/ITA_1997__31_6_499_0/

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. | MR | Zbl

2. S. A. Cook, The complexity of theorem-proving procedures. In Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158. | Zbl

3. N. Creignou and M. Hermann, Complexity of Generalized Satisfiability Counting Problems, Information and Computation, 1996, 125, (1), pp. 1-12. | MR | Zbl

4. W. F. Dowling and J. H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulæ, Journal of Logic Programming, 1984, 3, pp. 267-284. | MR | Zbl

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. | MR | Zbl

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. | MR | Zbl

7. A. Horn, On sentences which are true of direct unions of algebras, Journal of Symbolic Logic, 1951, 16, pp. 14-21. | MR | Zbl

8. D. S. Johnson, M. Yannakakis and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, 1988, 27, pp. 119-123. | MR | Zbl

9. R. E. Ladner, On the structure of polynomial time reducibility, Journal of the Association for Computing Machinery, 1975, 22, pp. 155-171. | MR | Zbl

10. A. K. Mackworth, Constraint Satisfaction, in S. C. Shapiro, ed., The encyclopedia of Artificial Intelligence, Wiley, New York, 1992, pp. 285-293. | MR

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. | MR

12. L. G. Valiant, The complexity of enumeration and reliability problems, SIAM Journal on Computing, 1979, 8, (3), pp. 410-421. | MR | Zbl