{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:37:27Z","timestamp":1736573847989,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540379010"},{"type":"electronic","value":"9783540379027"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11829263_6","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T07:32:51Z","timestamp":1158651171000},"page":"101-115","source":"Crossref","is-referenced-by-count":1,"title":["Partial Solutions with Unique Completion"],"prefix":"10.1007","author":[{"given":"Marco","family":"Cadoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1998.1575","volume":"57","author":"P. Beame","year":"1998","unstructured":"Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. Journal of Computer and System Sciences\u00a057(1), 3\u201319 (1998)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-3","key":"6_CR2","first-page":"80","volume":"55","author":"A. Blass","year":"1982","unstructured":"Blass, A., Gurevich, Y.: On the unique satisfiability problem. Information and Computation\u00a055(1-3), 80\u201388 (1982)","journal-title":"Information and Computation"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.artint.2004.01.006","volume":"162","author":"M. Cadoli","year":"2005","unstructured":"Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artificial Intelligence\u00a0162, 89\u2013120 (2005)","journal-title":"Artificial Intelligence"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1015019416843","volume":"28","author":"M. Cadoli","year":"2002","unstructured":"Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An algorithm to evaluate quantified boolean formulae and its experimental evaluation. Journal of Automated Reasoning\u00a028, 101\u2013142 (2002)","journal-title":"Journal of Automated Reasoning"},{"key":"6_CR5","first-page":"276","volume-title":"Constraint Networks (Survey)","author":"R. Dechter","year":"1992","unstructured":"Dechter, R.: Constraint Networks (Survey), pp. 276\u2013285. John Wiley & Sons, Inc., Chichester (1992)"},{"key":"6_CR6","unstructured":"Fagin, R.: Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In: Karp, R.M. (ed.) Complexity of Computation, pp. 43\u201374. AMS (1974)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Walsh, T.: Csplib: A benchmark library for constraints. Technical report, Technical report APES-09-1999. A shorter version appears in the Proceedings of the 5th International Conference on Principles and Practices of Constraint Programming, CP 1999 (1999), Available from: http:\/\/csplib.cs.strath.ac.uk\/","DOI":"10.1007\/978-3-540-48085-3_36"},{"key":"6_CR8","first-page":"67","volume-title":"Handbook of Theoretical Computer Science, ch. 2","author":"D.S. Johnson","year":"1990","unstructured":"Johnson, D.S.: A catalog of complexity classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 2, vol.\u00a0A, pp. 67\u2013161. Elsevier Science Publishers (North-Holland), Amsterdam (1990)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","volume":"81","author":"N. Megiddo","year":"1991","unstructured":"Megiddo, N., Papadimitriou, C.H.: On total functions, existence theorems and computational complexity. Theoretical Computer Science\u00a081, 317\u2013324 (1991)","journal-title":"Theoretical Computer Science"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1145\/378239.379017","volume-title":"Proceedings of the Thirtyeighth Conference on Design Automation (DAC 2001)","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the Thirtyeighth Conference on Design Automation (DAC 2001), pp. 530\u2013535. ACM Press, New York (2001)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theoretical Computer Science\u00a03, 1\u201322 (1976)","journal-title":"Theoretical Computer Science"},{"key":"6_CR12","volume-title":"The OPL Optimization Programming Language","author":"P. Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P.: The OPL Optimization Programming Language. The MIT Press, Cambridge (1999)"},{"key":"6_CR13","unstructured":"Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles (2002), Available at: http:\/\/www.phil.uu.nl\/~oostrom\/cki20\/02-03\/japansepuzzles\/ASP.pdf"}],"container-title":["Lecture Notes in Computer Science","Reasoning, Action and Interaction in AI Theories and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11829263_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T22:25:18Z","timestamp":1736547918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11829263_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540379010","9783540379027"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11829263_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}