{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:21Z","timestamp":1761611121871},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6419,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1996]]},"DOI":"10.1016\/s1571-0661(04)00042-8","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T05:14:39Z","timestamp":1075353279000},"page":"246-265","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Solving Binary CSP Using Computational Systems"],"prefix":"10.1016","volume":"4","author":[{"given":"Carlos","family":"Castro","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(94)90041-8","article-title":"Arc-consistency and arc-consistency again","volume":"65","author":"Bessi\u00e8re","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB2","unstructured":"C. Bessi\u00e8re. A fast algorithm to establish arc-consistency in constraint networks. Technical Report TR-94-003, LIRMM Universit\u00e9 de Montpellier II, January 1994."},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB3","doi-asserted-by":"crossref","unstructured":"C. Bessi\u00e8re, and J.-C. R\u00e9gin. An arc-consistency algorithm optimal in the number of constraint checks. In Proceedings of the Workshop on Constraint Processing, ECAI'94, Amsterdam, The Netherlands, pages 9\u201316, 1994.","DOI":"10.1109\/TAI.1994.346465"},{"issue":"3","key":"10.1016\/S1571-0661(04)00042-8_NEWBIB4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356631.356632","article-title":"New Programming Languages for Artificial Intelligence Research","volume":"6","author":"Bobrow","year":"1974","journal-title":"Computing Surveys"},{"issue":"2","key":"10.1016\/S1571-0661(04)00042-8_NEWBIB5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/321574.321591","article-title":"On Canonical Forms and Simplification","volume":"17","author":"Caviness","year":"1970","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB6","unstructured":"H. Comon, M. Dincbas, J.-P. Jouannaud, and C. Kirchner. A Methodological View of Constraint Solving. Working paper, 1996."},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB7","unstructured":"Y. Deville and P. V. Hentenryck. An efficient arc consistency algorithm for a class of csp problems. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 325\u2013330, 1991."},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(70)90003-2","article-title":"REF-ARF: A System for Solving Problems Stated as Procedures","volume":"1","author":"Fikes","year":"1970","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB9","unstructured":"E. C. Freuder. Using metalevel constraint knowledge to reduce constraint checking. In Proceedings of the Workshop on Constraint Processing, ECAI'94, Amsterdam, The Netherlands, pages 27\u201333, 1994."},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB10","series-title":"Logic for Computer Sciences, Foundations of Automatic Theorem Proving","author":"Gallier","year":"1986"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB11","doi-asserted-by":"crossref","unstructured":"H. Kirchner. On the Use of Constraints in Automated Deduction. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of Lecture Notes in Computer Science, pages 128\u2013146. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59155-9_8"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB12","series-title":"Principles and Practice of Constraint Programming. The Newport Papers","first-page":"131","article-title":"Designing constraint logic programming languages using computational systems","author":"Kirchner","year":"1995"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB13","unstructured":"C. Kirchner, H. Kirchner, and M. Vittek. ELAN, User Manual. INRIA Loraine & CRIN, Campus scientifique, 615, rue du Jardin Botanique, BP-101, 54602 Villers-l\u00e8s-Nancy Cedex, France, November 1995."},{"issue":"1","key":"10.1016\/S1571-0661(04)00042-8_NEWBIB14","first-page":"32","article-title":"Algorithms for Constraint-Satisfaction Problems: A Survey","volume":"13","author":"Kumar","year":"1992","journal-title":"Artificial Intelligence Magazine"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB15","doi-asserted-by":"crossref","unstructured":"J. H. M. Lee and H. F. Leung. Incremental Querying in the Concurrent CLP Language IFD-Constraint Pandora. In K. M. George, J. H. Carroll, D. Oppenheim, and J. Hightower, editors, Proceedings of the 11th Anual Symposium on Applied Computing, SAC'96, Philadelphia, Pennsylvania, USA, pages 387\u2013392, February 1996.","DOI":"10.1145\/331119.331211"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB16","series-title":"Constraint Programming Languages, Their Specification and Generation","author":"Leler","year":"1988"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in Networks of Relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","article-title":"The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems","volume":"25","author":"Mackworth","year":"1985","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S1571-0661(04)00042-8_NEWBIB19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional rewriting logic as a unified model of concurrency","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","article-title":"Arc and Path Consistency Revisited","volume":"28","author":"Mohr","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Information Sciences"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB22","series-title":"Search in Artificial Intelligence","first-page":"287","article-title":"Tree Search and Arc Consistency in Constraint-Satisfaction Algorithms","author":"Nadel","year":"1988"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB23","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0004-3702(92)90077-B","article-title":"Arc consistency for factorable relations","volume":"53","author":"Perlin","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB24","series-title":"Constraint Satisfaction in Logic Programming","author":"van Hentenryck","year":"1989"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB25","unstructured":"R. J. Wallace. Why AC-3 is almost always better than AC-4 for establishing arc concsistency in CSPs. In Proceedings IJCAI-93, pages 239\u2013245, 1993."},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB26","series-title":"The Psychology of Computer Vision","first-page":"19","article-title":"Understanding lines drawings of scenes with shadows","author":"Waltz","year":"1975"},{"key":"10.1016\/S1571-0661(04)00042-8_NEWBIB27","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/09528139650042547","article-title":"Backtracking along with constraint processing and their time complexities","volume":"8","author":"Zahn","year":"1996","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000428?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000428?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T04:53:43Z","timestamp":1550206423000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104000428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":27,"alternative-id":["S1571066104000428"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00042-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}