{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:12:10Z","timestamp":1742400730822},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285380"},{"type":"electronic","value":"9783540318279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11546207_21","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:41:23Z","timestamp":1127817683000},"page":"266-278","source":"Crossref","is-referenced-by-count":2,"title":["Lookahead in Smodels Compared to Local Consistencies in CSP"],"prefix":"10.1007","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohua","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li Yan","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Curtis","family":"Onuczko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Bessi\u00e8re, C.: Uniform random binary csp generator. Website, http:\/\/www.lirmm.fr\/~bessiere\/generator.html (Retrieved December 19, 2004)","key":"21_CR1"},{"unstructured":"Bessi\u00e8re, C., Debruyne, R.: Theoretical analysis of singleton arc consistency. In: Proc. ECAI 2004 Workshop on Modeling and Solving Problems with Constraints, pp. 20\u201329 (2004)","key":"21_CR2"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-24605-3_23","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Hebrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 299\u2013314. Springer, Heidelberg (2004)"},{"issue":"7","key":"21_CR4","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"},{"unstructured":"Debruyne, R., Bessi\u00e8re, C.: Some practical filtering techniques. In: Proc. IJCAI 1997, pp. 412\u2013417 (1997)","key":"21_CR5"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.834","volume":"14","author":"R. Debruyne","year":"2001","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Domain filtering consistencies. J. Artificial Intelligence Research\u00a014, 205\u2013230 (2001)","journal-title":"J. Artificial Intelligence Research"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-27775-0_6","volume-title":"Logic Programming","author":"I. Elkabani","year":"2004","unstructured":"Elkabani, I., Pontelli, E., Son, T.C.: Smodels with CLP and its applications: a simple and effective approach to aggregates in ASP. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 73\u201389. Springer, Heidelberg (2004)"},{"unstructured":"Freeman, J.W.: Improvements to propositional satisfiability search algorithms. PhD thesis, Department of Computer and Information Science, University of Pennsylvania (1995)","key":"21_CR8"},{"key":"21_CR9","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)"},{"doi-asserted-by":"crossref","unstructured":"Gent, I.: Arc consistency in SAT. In: Proc. ECAI 2003, pp. 121\u2013125 (2002)","key":"21_CR10","DOI":"10.1201\/b14295-7"},{"doi-asserted-by":"crossref","unstructured":"Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence, 275\u2013286 (1990)","key":"21_CR11","DOI":"10.1016\/0004-3702(90)90009-O"},{"issue":"3-4","key":"21_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":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-45349-0_26","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"P. Prosser","year":"2000","unstructured":"Prosser, P., Stergiou, K., Walsh, T.: Singleton consistencies. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 353\u2013368. Springer, Heidelberg (2000)"},{"unstructured":"Simons, P.: Extending and Implementing the Stable Model Semantics. PhD thesis, Helsinki University of Technology, Helsinki, Finland (2000)","key":"21_CR14"},{"key":"21_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)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-540-27775-0_22","volume-title":"Logic Programming","author":"J. You","year":"2004","unstructured":"You, J., Hou, G.: Arc consistency + unit propagation = lookahead. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 314\u2013328. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11546207_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:18:47Z","timestamp":1605626327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11546207_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285380","9783540318279"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11546207_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}