{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T08:18:11Z","timestamp":1672474691823},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6141,"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":[[1996,10]]},"DOI":"10.1016\/0004-3702(95)00102-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"245-267","source":"Crossref","is-referenced-by-count":3,"title":["Uncovering trees in constraint networks"],"prefix":"10.1016","volume":"86","author":[{"given":"Itay","family":"Meiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rina","family":"Dechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Judea","family":"Pearl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00102-6_BIB1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0004-3702(94)90021-3","article-title":"Characterizing tractable constraints","volume":"65","author":"Cooper","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00102-6_BIB2","series-title":"Proceedings AAAI-87","first-page":"105","article-title":"Removing redundancies in constraint networks","author":"Dechter","year":"1987"},{"key":"10.1016\/0004-3702(95)00102-6_BIB3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(90)90031-F","article-title":"Decomposing a relation into a tree of binary relations","volume":"41","author":"Dechter","year":"1990","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0004-3702(95)00102-6_BIB4","series-title":"Encyclopedia of Artificial Intelligence","first-page":"276","article-title":"Constraint networks","author":"Dechter","year":"1992"},{"key":"10.1016\/0004-3702(95)00102-6_BIB5","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":"10.1016\/0004-3702(95)00102-6_BIB6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","article-title":"Structure identification in relational data","volume":"58","author":"Dechter","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00102-6_BIB7","author":"Even","year":"1979"},{"key":"10.1016\/0004-3702(95)00102-6_BIB8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0004-3702(93)90063-H","article-title":"Fast parallel constraint satisfaction","volume":"64","author":"Kirousis","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00102-6_BIB9","series-title":"Encyclopedia of Artificial Intelligence","first-page":"276","article-title":"Constraint satisfaction","author":"Mackworth","year":"1992"},{"key":"10.1016\/0004-3702(95)00102-6_BIB10","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":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00102-6_BIB11","author":"Maier","year":"1983"},{"key":"10.1016\/0004-3702(95)00102-6_BIB12","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":"Inform. Sci."},{"key":"10.1016\/0004-3702(95)00102-6_BIB13","unstructured":"I. Rish, Personal communication (April 1995)."},{"key":"10.1016\/0004-3702(95)00102-6_BIB14","article-title":"Tractability through theory approximation","author":"Selman","year":"1992"},{"key":"10.1016\/0004-3702(95)00102-6_BIB15","unstructured":"J. Ullman, Personal communication."},{"key":"10.1016\/0004-3702(95)00102-6_BIB16","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1145\/210346.210347","article-title":"On the minimality and the decomposability of row-convex constraint networks","volume":"42","author":"van Beek","year":"1995","journal-title":"J. ACM"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295001026?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295001026?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:28:07Z","timestamp":1555064887000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295001026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0004370295001026"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00102-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}