{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:32:13Z","timestamp":1720625533262},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4920,"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":[[2001,6]]},"DOI":"10.1016\/s1571-0661(04)00154-9","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"147-166","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the Number of Rule Applications in Constraint Programs"],"prefix":"10.1016","volume":"48","author":[{"given":"Thom","family":"Fr\u00fchwirth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Abdennadher S., Operational semantics and confluence of constraint propagation rules, in: 3rd Intl. Conf. on Principles and Practice of Constraint Programming, LNCS 1330 (1997), pp. 252\u2013266.","DOI":"10.1007\/BFb0017444"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB2","series-title":"Constraint Programming: Basics and Trends, LNCS 910","first-page":"1","article-title":"Interval constraint logic programming","author":"Benhamou","year":"1995"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Bertolino M., S. Etalle and C. Palamidessi, The replacement operation for ccp programs, in: A. Bossi, editor, Proceedings of 9th International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99), LNCS 1817 (2000), pp. 216\u2013233.","DOI":"10.1007\/10720327_13"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB4","series-title":"New Trends in Constraints, Papers from the Joint ERCIM\/Compulog-Net Workshop","first-page":"212","article-title":"Quantitative observables and averages in probabilistic constraint programming","author":"Di Pierro","year":"2000"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB5","series-title":"\u201cQualitative Spatial Reasoning: Theory and Practice\u201d","author":"Escrig","year":"1998"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB6","unstructured":"Fr\u00fchwirth T., Temporal reasoning with constraint simplification rules, Technical Report ECRC-94-05, ECRC, Munich (1994)."},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","article-title":"Theory and practice of constraint handling rules, special issue on constraint logic programming","volume":"37","author":"Fr\u00fchwirth","year":"1998","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB8","series-title":"Neuvi\u00ebmes Journ\u00ebes Francophones de Programmation Logique et Programmation par Contraintes (JFPLC'2000)","article-title":"Predicting derivation lengths in rule-based constraint programs","author":"Fr\u00fchwirth","year":"2000"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB9","series-title":"New Trends in Constraints, Papers from the Joint ERCIM\/Compulog-Net Workshop","article-title":"Proving termination of constraint solver programs","author":"Fr\u00fchwirth","year":"2000"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB10","series-title":"\u201cConstraint-Programming\u201d","author":"Fr\u00fchwirth","year":"1997"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB11","series-title":"Principles and Practice of Constraint Programming","first-page":"361","article-title":"Terminological reasoning with constraint handling rules","author":"Fr\u00fchwirth","year":"1995"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming: A survey","volume":"19 & 20","author":"Jaffar","year":"1994","journal-title":"The Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB13","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":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB14","series-title":"\u201cProgramming with Constraints: An Introduction\u201d","author":"Marriott","year":"1998"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB15","series-title":"Constraint Logic Programming: Selected Research","first-page":"253","article-title":"A study on boolean constraint solvers","author":"Menju","year":"1993"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","article-title":"Arc and Path Consistency Revisited","volume":"28","author":"Mohr","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB17","doi-asserted-by":"crossref","unstructured":"Patel-Schneider P., and M.-C. Rousset, Special issue on description logics (1999).","DOI":"10.1093\/logcom\/9.3.265"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","article-title":"A generic arc-consistency algorithm and its specializations","volume":"57","author":"van Hentenryck","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)00154-9_NEWBIB19","series-title":"Constraint Programming: Basics and Trends, LNCS 910","first-page":"1","article-title":"Constraint processing in cc(fd)","author":"van Hentenryck","year":"1995"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001549?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001549?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T06:57:24Z","timestamp":1550213844000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":19,"alternative-id":["S1571066104001549"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00154-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}