{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T23:05:59Z","timestamp":1778886359010,"version":"3.51.4"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4008,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0004-3702(02)00210-2","type":"journal-article","created":{"date-parts":[[2002,9,9]],"date-time":"2002-09-09T20:43:49Z","timestamp":1031604229000},"page":"1-37","source":"Crossref","is-referenced-by-count":31,"title":["Binary vs. non-binary constraints\u2606\u2606This paper includes results that first appeared in [1,4,23]. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program."],"prefix":"10.1016","volume":"140","author":[{"given":"Fahiem","family":"Bacchus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinguang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"van Beek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00210-2_BIB001","series-title":"Proc. AAAI-98, Madison, WI","first-page":"311","article-title":"On the conversion between non-binary and binary constraint satisfaction problems","author":"Bacchus","year":"1998"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB002","series-title":"Proc. IJCAI-97, Nagoya, Japan","first-page":"398","article-title":"Arc consistency for general constraint networks: Preliminary results","author":"Bessi\u00e8re","year":"1997"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB003","unstructured":"J.E. Borrett, Formulation selection for constraint satisfaction problems: A heuristic approach, Ph.D. Thesis, University of Essex, 1998"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB004","unstructured":"X. Chen, A theoretical comparison of selected CSP solving and modeling techniques, Ph.D. Thesis, University of Alberta, Edmonton, AB, 2000"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB005","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.834","article-title":"Domain filtering consistencies","volume":"14","author":"Debruyne","year":"2001","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(02)00210-2_BIB006","series-title":"Proc. AAAI-90, Boston, MA","first-page":"556","article-title":"On the expressiveness of networks with hidden variables","author":"Dechter","year":"1990"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB007","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","article-title":"Tree clustering for constraint networks","volume":"38","author":"Dechter","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB008","series-title":"Proc. Second Canadian Conference on Artificial Intelligence, Toronto, ON","first-page":"268","article-title":"Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems","author":"Gaschnig","year":"1978"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB009","series-title":"Proc. AAAI-97, Providence, RI","first-page":"302","article-title":"Effective redundant constraints for online scheduling","author":"Getoor","year":"1997"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB010","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB011","series-title":"Proc. AAAI-93, Washington, DC","first-page":"731","article-title":"Decomposition of domains based on the micro-structure of finite constraint satisfaction problems","author":"J\u00e9gou","year":"1993"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB012","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0004-3702(96)00027-6","article-title":"A theoretical evaluation of selected backtracking algorithms","volume":"89","author":"Kondrak","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB013","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\/S0004-3702(02)00210-2_BIB014","series-title":"Proc. IJCAI-77, Cambridge, MA","first-page":"598","article-title":"On reading sketch maps","author":"Mackworth","year":"1977"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB015","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","article-title":"Relational consistency algorithms and their application in finding subgraph and graph isomorphisms","volume":"19","author":"McGregor","year":"1979","journal-title":"Inform. Sci."},{"key":"10.1016\/S0004-3702(02)00210-2_BIB016","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1111\/j.1467-8640.1989.tb00328.x","article-title":"Constraint satisfaction algorithms","volume":"5","author":"Nadel","year":"1989","journal-title":"Comput. Intelligence"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB017","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/64.54670","article-title":"Representation selection for constraint satisfaction: A case study using n-queens","volume":"5","author":"Nadel","year":"1990","journal-title":"IEEE Expert"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB018","volume":"III","author":"Peirce","year":"1933"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB019","unstructured":"F. Rossi, C. Petrie, V. Dhar, On the equivalence of constraint satisfaction problems, Technical Report ACT-AI-222-89, MCC, Austin, TX, 1989. A shorter version appears in: Proc. ECAI-90, Stockholm, Sweden, pp. 550\u2013556"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB020","series-title":"Proc. ECAI-94, Amsterdam","first-page":"125","article-title":"Contradicting conventional wisdom in constraint satisfaction","author":"Sabin","year":"1994"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB021","unstructured":"H. Simonis, Standard models for finite domain constraint solving, Tutorial presented at PACT'97 Conference London, UK, 1997"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB022","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF00143880","article-title":"The progressive party problem: Integer linear programming and constraint programming compared","volume":"1","author":"Smith","year":"1996","journal-title":"Constraints"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB023","series-title":"Proc. AAAI-99, Orlando, FL","first-page":"163","article-title":"Encodings of non-binary constraint satisfaction problems","author":"Stergiou","year":"1999"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB024","series-title":"Proc. AAAI-99, Orlando, FL","first-page":"585","article-title":"CPlan: A constraint programming approach to planning","author":"van Beek","year":"1999"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB025","series-title":"Constraint Satisfaction in Logic Programming","author":"Van Hentenryck","year":"1989"},{"key":"10.1016\/S0004-3702(02)00210-2_BIB026","series-title":"Proc. 13th European Conference on Artificial Intelligence, Brighton, UK","first-page":"254","article-title":"On reformulation of constraint satisfaction problems","author":"Weigel","year":"1998"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T09:00:46Z","timestamp":1580893246000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202002102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0004370202002102"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00210-2","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}