{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:21:42Z","timestamp":1725686502509},"reference-count":12,"publisher":"EDP Sciences","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1997]]},"DOI":"10.1051\/ita\/1997310604991","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:58:52Z","timestamp":1486047532000},"page":"499-511","source":"Crossref","is-referenced-by-count":38,"title":["On generating all solutions of generalized satisfiability problems"],"prefix":"10.1051","volume":"31","author":[{"given":"N.","family":"Creignou","sequence":"first","affiliation":[]},{"given":"J.-J.","family":"Hebrard","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. ASPVALL B., PLASS M. F. and TARJAN R. E., A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, 1979, 8, (3), pp. 121-123.5264510398.68042","DOI":"10.1016\/0020-0190(79)90002-4"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. COOK S. A., The complexity of theorem-proving procedures. In Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.0253.68020","DOI":"10.1145\/800157.805047"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. CREIGNOU N. and HERMANN M., Complexity of Generalized Satisfiability Counting Problems, Information and Computation, 1996, 125, (1), pp. 1-12.13858040853.68110","DOI":"10.1006\/inco.1996.0016"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. DOWLING W. F. and GALLIER J. H., Linear-time algorithms for testing the satisfiability of propositional Horn formul\u00e6, Journal of Logic Programming, 1984, 3, pp. 267-284.7701560593.68062","DOI":"10.1016\/0743-1066(84)90014-1"},{"key":"R5","unstructured":"5. GAREY M. R. and JOHNSON D. S., Computers and intractability: A guide to the theory of NP-completeness, W. H. Freeman and Co, 1979.5190660411.68039"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. HELL P. and NE\u0160ET\u0158IL J., On the complexity of H-coloring, Journal of Combinatorial Theory, Series B, 1990, 48, pp. 92-110.10475550639.05023","DOI":"10.1016\/0095-8956(90)90132-J"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. HORN A., On sentences which are true of direct unions of algebras, Journal of Symbolic Logic, 1951, 16, pp. 14-21.402330043.24801","DOI":"10.2307\/2268661"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. JOHNSON D. S., YANNAKAKIS M. and PAPADIMITRIOU C. H., On generating all maximal independent sets, Information Processing Letters, 1988, 27, pp. 119-123.9332710654.68086","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. LADNER R. E., On the structure of polynomial time reducibility, Journal of the Association for Computing Machinery, 1975, 22, pp. 155-171.4646980322.68028","DOI":"10.1145\/321864.321877"},{"key":"R10","unstructured":"10. MACKWORTH A. K., Constraint Satisfaction, in S. C. Shapiro, ed., The encyclopedia of Artificial Intelligence, Wiley, New York, 1992, pp. 285-293.1192394"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. SCHAEFER T. J., The complexity of satisfiability problems. In Proceedings 10th STOC, San Diego (CA, USA), Association for Computing Machinery, 1978, pp. 216-226.1282.68143521057","DOI":"10.1145\/800133.804350"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. VALIANT L. G., The complexity of enumeration and reliability problems, SIAM Journal on Computing, 1979, 8, (3), pp. 410-421.5392580419.68082","DOI":"10.1137\/0208032"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1997310604991\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:56:25Z","timestamp":1568786185000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1997310604991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":12,"journal-issue":{"issue":"6"},"alternative-id":["ita1997310604991"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1997310604991","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}