{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:22Z","timestamp":1761620782644},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5319,"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":[[1999,1]]},"DOI":"10.1016\/s0004-3702(98)00108-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:24:09Z","timestamp":1027643049000},"page":"149-163","source":"Crossref","is-referenced-by-count":51,"title":["Maintaining reversible DAC for Max-CSP"],"prefix":"10.1016","volume":"107","author":[{"given":"Javier","family":"Larrosa","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Meseguer","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schiex","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(98)00108-8_BIB1","series-title":"Proc. ECAI-98","first-page":"209","article-title":"A weighted arc consistency technique for Max-CSP","author":"Affane","year":"1998"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB2","series-title":"Proc. IJCAI-95","article-title":"Constraint solving over semirings","author":"Bistarelli","year":"1995"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB3","unstructured":"B. Cabon, S. de Givry, L. Lobjois, T. Schiex, J.P. Warners, Radio link frequency assignment, Constraints (to appear)."},{"key":"10.1016\/S0004-3702(98)00108-8_BIB4","article-title":"Algorithmes d'optimisation sous contraintes \u00e9tudi\u00e9s dans un cadre temps-r\u00e9el","author":"de Givry","year":"1988"},{"key":"10.1016\/S0004-3702(98)00108-8_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":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","article-title":"Partial constraint satisfaction","volume":"58","author":"Freuder","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB7","series-title":"Proc. CP-96","first-page":"308","article-title":"Exploiting the use of DAC in Max-CSP","author":"Larrosa","year":"1996"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB8","series-title":"Proc. AAAI-98","first-page":"347","article-title":"Reversible DAC and other improvements for solving Max-CSP","author":"Larrosa","year":"1998"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB9","first-page":"95","article-title":"Binary constraint satisfaction problems: Some are harder than others","author":"Prosser","year":"1994"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB10","series-title":"Proc. ECAI-94","first-page":"125","article-title":"Contradicting conventional wisdom in constraint satisfaction","author":"Sabin","year":"1994"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB11","article-title":"Maximizing the reversible DAC lower bound in Max-CSP is NP-hard","author":"Schiex","year":"1998"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB12","series-title":"Proc. IJCAI-95","first-page":"631","article-title":"Valued constraint satisfaction problems: hard and easy problems","author":"Schiex","year":"1995"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB13","series-title":"Proc. AAAI-96","first-page":"181","article-title":"Russian doll search","author":"Verfaillie","year":"1996"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB14","series-title":"Selected papers from the ECAI-94 Workshop on Constraint Processing","first-page":"121","article-title":"Directed arc consistency preprocessing","volume":"Vol. 923","author":"Wallace","year":"1995"},{"key":"10.1016\/S0004-3702(98)00108-8_BIB15","series-title":"Proc. AAAI-96","first-page":"188","article-title":"Enhancements of branch and bound methods for the maximal constraint satisfaction problem","author":"Wallace","year":"1996"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298001088?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298001088?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:50:48Z","timestamp":1555051848000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370298001088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0004370298001088"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00108-8","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}