{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:56:34Z","timestamp":1760597794655},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"9","license":[{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9,1]]},"DOI":"10.1093\/comjnl\/bxx122","type":"journal-article","created":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T12:36:31Z","timestamp":1512131791000},"page":"1338-1350","source":"Crossref","is-referenced-by-count":3,"title":["Exploring Directional Path-Consistency for Solving Constraint Networks"],"prefix":"10.1093","volume":"61","author":[{"given":"Shufeng","family":"Kong","sequence":"first","affiliation":[{"name":"QSI, FEIT, University of Technology Sydney, 81 Broadway, Ultimo NSW, Australia"}]},{"given":"Sanjiang","family":"Li","sequence":"additional","affiliation":[{"name":"QSI, FEIT, University of Technology Sydney, 81 Broadway, Ultimo NSW, Australia"},{"name":"UTS-AMSS Joint Research Laboratory, AMSS, Chinese Academy of Sciences, 55 East Zhongguancun Road, Haidian, Beijing, China"}]},{"given":"Michael","family":"Sioutis","sequence":"additional","affiliation":[{"name":"AASS, \u00d6rebro University, Fakultetsgatan 1, \u00d6rebro, Sweden"}]}],"member":"286","published-online":{"date-parts":[[2017,12,27]]},"reference":[{"key":"key\n\t\t\t\t20180827114447_bxx122C1","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":"Inf. Sci."},{"key":"key\n\t\t\t\t20180827114447_bxx122C2","author":"Maruyama","year":"1990"},{"key":"key\n\t\t\t\t20180827114447_bxx122C3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C4","author":"Planken","year":"2008"},{"key":"key\n\t\t\t\t20180827114447_bxx122C5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.artint.2013.05.006","article-title":"Qualitative constraint satisfaction problems: an extended framework with landmarks","volume":"201","author":"Li","year":"2013","journal-title":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C6","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition for backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"key":"key\n\t\t\t\t20180827114447_bxx122C7","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":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0004-3702(88)90081-1","article-title":"Comments on mohr and henderson\u2019s path consistency algorithm","volume":"36","author":"Han","year":"1988","journal-title":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1142\/S0218213096000092","article-title":"Path consistency revisited","volume":"5","author":"Singh","year":"1996","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"key\n\t\t\t\t20180827114447_bxx122C10","author":"Bliek","year":"1999"},{"key":"key\n\t\t\t\t20180827114447_bxx122C11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1142\/S0218213098000081","article-title":"Efficient path-consistency propagation","volume":"7","author":"Chmeiss","year":"1998","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"key\n\t\t\t\t20180827114447_bxx122C12","doi-asserted-by":"crossref","first-page":"3:1","DOI":"10.1145\/2556646","article-title":"Constraint satisfaction problems solvable by local consistency methods","volume":"61","author":"Barto","year":"2014","journal-title":"J. ACM"},{"key":"key\n\t\t\t\t20180827114447_bxx122C13","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1093\/logcom\/exu070","article-title":"The collapse of the bounded width hierarchy","volume":"26","author":"Barto","year":"2016","journal-title":"J. Logic Comput."},{"key":"key\n\t\t\t\t20180827114447_bxx122C14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint-satisfaction problems","volume":"34","author":"Dechter","year":"1987","journal-title":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C15","author":"Sioutis","year":"2016"},{"key":"key\n\t\t\t\t20180827114447_bxx122C16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10601-015-9198-6","article-title":"Tractability in constraint satisfaction problems: A survey","volume":"21","author":"Carbonnel","year":"2016","journal-title":"Constraints"},{"key":"key\n\t\t\t\t20180827114447_bxx122C17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0004-3702(99)00012-0","article-title":"Constraint satisfaction over connected row convex constraints","volume":"109","author":"Deville","year":"1999","journal-title":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C18","author":"Kong","year":"2015"},{"key":"key\n\t\t\t\t20180827114447_bxx122C19","author":"Kumar","year":"2005"},{"key":"key\n\t\t\t\t20180827114447_bxx122C20","author":"Kumar","year":"2006"},{"key":"key\n\t\t\t\t20180827114447_bxx122C21","author":"Kumar","year":"2004"},{"key":"key\n\t\t\t\t20180827114447_bxx122C22","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pac. J. Math."},{"key":"key\n\t\t\t\t20180827114447_bxx122C23","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0004-3702(98)00022-8","article-title":"Constraints, consistency and closure","volume":"101","author":"Jeavons","year":"1998","journal-title":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S1574-6526(06)80012-X","volume-title":"Handbook of Constraint Programming","author":"Cohen","year":"2006"},{"key":"key\n\t\t\t\t20180827114447_bxx122C25","volume-title":"Constraint Processing.","author":"Dechter","year":"2003"},{"key":"key\n\t\t\t\t20180827114447_bxx122C26","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1145\/210346.210347","article-title":"On the minimality and global consistency of row-convex constraint networks","volume":"42","author":"van Beek","year":"1995","journal-title":"J. ACM"},{"key":"key\n\t\t\t\t20180827114447_bxx122C27","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1016\/j.artint.2009.05.004","article-title":"Solving connected row convex constraints by variable elimination","volume":"173","author":"Zhang","year":"2009","journal-title":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C28","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","article-title":"Tractable constraints on ordered domains","volume":"79","author":"Jeavons","year":"1995","journal-title":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C29","author":"Zhang","year":"2003"},{"key":"key\n\t\t\t\t20180827114447_bxx122C30","author":"Bulatov","year":"2003"},{"key":"key\n\t\t\t\t20180827114447_bxx122C31","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10472-017-9552-z","article-title":"On tree-preserving constraints","volume":"81","author":"Kong","year":"2017","journal-title":"Ann. Math. Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C32","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10601-009-9080-5","article-title":"Efficient algorithms for singleton arc consistency","volume":"16","author":"Bessi\u00e8re","year":"2011","journal-title":"Constraints"},{"key":"key\n\t\t\t\t20180827114447_bxx122C33","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.artint.2005.02.004","article-title":"An optimal coarse-grained arc consistency algorithm","volume":"165","author":"Bessi\u00e8re","year":"2005","journal-title":"Artif. Intell."},{"key":"key\n\t\t\t\t20180827114447_bxx122C34","author":"Debruyne","year":"1997"},{"key":"key\n\t\t\t\t20180827114447_bxx122C35","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1093\/logcom\/exr039","article-title":"Arc consistency and friends","volume":"23","author":"Chen","year":"2011","journal-title":"J. Logic Comput."},{"key":"key\n\t\t\t\t20180827114447_bxx122C36","author":"Kozik","year":"2016"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/61\/9\/1338\/25570084\/bxx122.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T06:48:21Z","timestamp":1570430901000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/61\/9\/1338\/4779882"}},"subtitle":[],"editor":[{"given":"Daniel","family":"Paulusma","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2017,12,27]]},"references-count":36,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2017,12,27]]},"published-print":{"date-parts":[[2018,9,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxx122","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,9]]},"published":{"date-parts":[[2017,12,27]]}}}