{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T08:18:48Z","timestamp":1649060328012},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3619,"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":[[2003,9]]},"DOI":"10.1016\/s1571-0661(04)80675-3","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"45-60","source":"Crossref","is-referenced-by-count":1,"title":["Deductive Generation of Constraint Propagation Rules"],"prefix":"10.1016","volume":"86","author":[{"given":"Sebastian","family":"Brand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80675-3_NEWBIB1","unstructured":"Slim Abdennadher and Thom Fr\u00fchwirth. Using program analysis for integration and optimization of rule-based constraint solvers. In Proc. of Journ\u00e9es Francophones de Progr. Logique et Progr. par Contraintes, 2002."},{"issue":"2","key":"10.1016\/S1571-0661(04)80675-3_NEWBIB2","article-title":"Automatic generation of rule-based solvers for intentionally defined constraints","volume":"11","author":"Slim","year":"2002","journal-title":"International Journal on Artificial Intelligence Tools"},{"issue":"6","key":"10.1016\/S1571-0661(04)80675-3_NEWBIB3","doi-asserted-by":"crossref","DOI":"10.1017\/S1471068401000072","article-title":"Constraint programming viewed as rule-based programming","volume":"1","author":"Apt","year":"2001","journal-title":"Theory and Practice of Logic Programming"},{"key":"10.1016\/S1571-0661(04)80675-3_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Lucas Bordeaux and Eric Monfroy. Beyond NP: Arc-consistency for quantified constraints. In Proc. of Principles and Practice of Constraint Programming, Ithaka, 2002.","DOI":"10.1007\/3-540-46135-3_25"},{"key":"10.1016\/S1571-0661(04)80675-3_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Sebastian Brand. A note on redundant rules in rule-based constraint programming. In Recent Advances in Constraints, volume 2627 of Lecture Notes in Artifical Intelligence. Springer, 2003.","DOI":"10.1007\/3-540-36607-5_8"},{"key":"10.1016\/S1571-0661(04)80675-3_NEWBIB6","unstructured":"Bj\u00f6rn Carlson, Mats Carlsson, and Sverker Janson. The implementation of AKL(FD). In Proc. of International Symposium on Logic Programming, 1995."},{"issue":"6","key":"10.1016\/S1571-0661(04)80675-3_NEWBIB7","article-title":"CLAIRE: Combining sets, search and rules to better express algorithms","volume":"2","author":"Yves","year":"2002","journal-title":"Theory and Practice of Logic Programming"},{"issue":"3","key":"10.1016\/S1571-0661(04)80675-3_NEWBIB8","article-title":"Building constraint satisfaction problem solvers using rewrite rules and strategies","volume":"34","author":"Carlos","year":"1998","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"10.1016\/S1571-0661(04)80675-3_NEWBIB9","article-title":"Local and global relational consistency","volume":"173","author":"Rina","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80675-3_NEWBIB10","article-title":"Theory and practice of constraint handling rules","author":"Thom","year":"1998","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"10.1016\/S1571-0661(04)80675-3_NEWBIB11","article-title":"Rule-based constraint programming","volume":"34","author":"Claude","year":"1998","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1571-0661(04)80675-3_NEWBIB12","unstructured":"David A. Randell, Zhan Cui, and Anthony Cohn. A spatial logic based on regions and connection. In Proc. of Principles of Knowledge Representation and Reasoning. Morgan Kaufmann, 1992."},{"key":"10.1016\/S1571-0661(04)80675-3_NEWBIB13","doi-asserted-by":"crossref","unstructured":"Christophe Ringeissen and Eric Monfroy. Generating propagation rules for finite domains via unification in finite algebras. In New Trends in Constraints, volume 1865 of Lecture Notes in Artifical Intelligence. Springer, 2000.","DOI":"10.1007\/3-540-44654-0_8"},{"key":"10.1016\/S1571-0661(04)80675-3_NEWBIB14","series-title":"Concurrent Constraint Programming","author":"Saraswat","year":"1993"},{"key":"10.1016\/S1571-0661(04)80675-3_NEWBIB15","doi-asserted-by":"crossref","unstructured":"Gert Smolka. The Oz programming model. In Computer Science Today, volume 1000 of Lecture Notes in Computer Science. Springer, 1995.","DOI":"10.1007\/BFb0020450"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806753?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:14:24Z","timestamp":1585898064000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S1571066104806753"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80675-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}