{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T14:11:33Z","timestamp":1737123093843,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678397"},{"type":"electronic","value":"9783540449140"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44914-0_14","type":"book-chapter","created":{"date-parts":[[2007,5,22]],"date-time":"2007-05-22T21:26:14Z","timestamp":1179869174000},"page":"233-246","source":"Crossref","is-referenced-by-count":0,"title":["Reformulating Propositional Satisfiability as Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Toby","family":"Walsh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"14_CR1","unstructured":"H. Bennaceur. The satisfiability problem regarded as a constraint satisfaction problem. In W. Wahlster, editor, Proceedings of the 12th EC AI, pages 155\u2013159. European Conference on Artificial Intelligence, Wiley, 1996."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"C. Bessiere, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. In Proceedings of IJCAI-99 Workshop on Non-binary constraints International Joint Conference on Artificial Intelligence, 1999.","DOI":"10.1007\/978-3-540-48085-3_7"},{"key":"14_CR3","unstructured":"F. Bacchus and P. van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In Proceedings of 15th National Conference on Artificial Intelligence, pages 311\u2013318. AAAI Press\/The MIT Press, 1998."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"V. Chvatal and B. Reed. Mick gets some (the odds are on his side). In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 620\u2013627. IEEE, 1992.","DOI":"10.1109\/SFCS.1992.267789"},{"key":"14_CR5","unstructured":"R. Debruyne and C. Bessi\u00e9re. Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings of the 15th IJCAI, pages 412\u2013417. International Joint Conference on Artificial Intelligence, 1997."},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","volume":"41","author":"R. Dechter","year":"1990","unstructured":"R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning and cutset decompositio. Artificial Intelligence, 41(3):273\u2013312, 1990.","journal-title":"Artificial Intelligence"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394\u2013397, 1962.","journal-title":"Communications of the ACM"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M. L. Ginsberg","year":"1993","unstructured":"M. L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, 1:25\u201346, 1993.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"14_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/3-540-55808-X_25","volume-title":"Mathematical Foundations of Computer Science","author":"A. Goerdt","year":"1992","unstructured":"A. Goerdt. A theshold for unsatisfiability. In I. Havel and V. Koubek, editors, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, pages 264\u2013274. Springer Verlag, 1992."},{"key":"14_CR10","unstructured":"H. Kautz and B. Selman. BLACKBOX: A new approach to the application of theorem proving to problem solving. In Working notes of the Workshop on Planning as Combinatorial Search, 1998. Held in conjunction with AIPS-98, Pittsburgh, PA, 1998."},{"key":"14_CR11","unstructured":"H. Kautz and B. Selman. The role of domain-specific knowledge in the planning as satisfiability framework. In Proceedings of AIPS-98, Pittsburgh, PA, 1998."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"C.H. Papadimitriou. On selecting a satisfying truth assigment. In Proceedings of the Conference on the Foundations of Computer Science, pages 163\u2013169, 1991.","DOI":"10.1109\/SFCS.1991.185365"},{"key":"14_CR13","unstructured":"K. Stergiou and T. Walsh. Encodings of non-binary constraint satisfaction problems. In Proceedings of the 16th National Conference on AI American Association for Artificial Intelligence, 1999."},{"key":"14_CR14","unstructured":"P. van Beek and X. Chen. Cplan: a constraint programming approach to planning. In Proceedings of 16th National Conference on Artificial Intelligence AAAI Press\/The MIT Press, 1999."}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44914-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T14:53:15Z","timestamp":1737039195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44914-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678397","9783540449140"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44914-0_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}