{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:31Z","timestamp":1725565411109},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_22","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"314-328","source":"Crossref","is-referenced-by-count":4,"title":["Arc-Consistency + Unit Propagation = Lookahead"],"prefix":"10.1007","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[]},{"given":"Guiwen","family":"Hou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"22_CR1","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"22_CR2","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"22_CR3","unstructured":"Freeman, J.W.: Improvements to propositional satisfiability search algorithms. PhD thesis, Department of Computer and Information Science, University of Pennsylvania (1995)"},{"issue":"11","key":"22_CR4","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1145\/359642.359654","volume":"21","author":"E.C. Freuder","year":"1978","unstructured":"Freuder, E.C.: Synthesizing constraint expressions. CACM\u00a021(11), 958\u2013966 (1978)","journal-title":"CACM"},{"issue":"3","key":"22_CR5","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of the ACM"},{"key":"22_CR6","first-page":"1070","volume-title":"Proc. 5th ICLP","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. 5th ICLP, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Gent, I.: Arc consistency in SAT. In: Proc. ECAI 2003, pp. 121\u2013125 (2002)","DOI":"10.1201\/b14295-7"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence, 275\u2013286 (1990)","DOI":"10.1016\/0004-3702(90)90009-O"},{"key":"22_CR9","unstructured":"Leone, N., et al.: DLV: a disjunctive datalog system, release 2000-10-15 (2000), At http:\/\/www.dbai.tuwien.ac.at\/proj\/dlv\/"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"Mackworth, A.: Consistency in networks of relations. Artificial Intelligence\u00a08(1), 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"22_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints","author":"K. Marriott","year":"1998","unstructured":"Marriott, K., Stucky, P.: Programming with Constraints. MIT Press, Cambridge (1998)"},{"issue":"3-4","key":"22_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"22_CR13","unstructured":"Simons, P.: Extending and Implementing the Stable Model Semantics. PhD thesis, Helsinki University of Technology, Helsinki, Finland (2000)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2) (2002)","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: CSP vs. SAT. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:19:54Z","timestamp":1605759594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}