{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:19Z","timestamp":1761620779016},"reference-count":43,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7323,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0743-1066(93)90047-k","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"319-359","source":"Crossref","is-referenced-by-count":27,"title":["Generalized constraint propagation over the CLP scheme"],"prefix":"10.1016","volume":"16","author":[{"given":"Thierry","family":"Le Provost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0743-1066(93)90047-K_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/comjnl\/30.2.183","article-title":"Crossword Compilation with Horn Clauses","volume":"30","author":"Berghel","year":"1987","journal-title":"Comput. J."},{"key":"10.1016\/0743-1066(93)90047-K_BIB2","article-title":"Experiments with Set-Oriented Propagation","author":"Bressan","year":"1993","journal-title":"ECRC report"},{"key":"10.1016\/0743-1066(93)90047-K_BIB3","series-title":"Technical Report 79\/59","article-title":"Predicate Logic as a Computational Formalism","author":"Clark","year":"1979"},{"key":"10.1016\/0743-1066(93)90047-K_BIB4","first-page":"3","article-title":"Theoretical Model of Prolog II","author":"Colmerauer","year":"1985"},{"key":"10.1016\/0743-1066(93)90047-K_BIB5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","article-title":"Constraint Propagation with Interval Labels","volume":"32","author":"Davis","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90047-K_BIB6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0743-1066(90)90052-7","article-title":"Solving Large Combinatorial Problems in Logic Programming","volume":"8","author":"Dincbas","year":"1990","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)90047-K_BIB7","first-page":"693","article-title":"The Constraint Logic Programming Language CHIP","author":"Dincbas","year":"1988","journal-title":"Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88)"},{"key":"10.1016\/0743-1066(93)90047-K_BIB8","article-title":"Constraints Handling, Garbage Collection and Execution Model Issues in ElipSys","volume":"Vol. 569","author":"Dorochevsky","year":"1991"},{"key":"10.1016\/0743-1066(93)90047-K_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(70)90003-2","article-title":"REF-ARF: A System for Solving Problems Stated as Procedures","volume":"1","author":"Fikes","year":"1970","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90047-K_BIB10","article-title":"Constraint Simplification Rules","author":"Fruehwirth","year":"1992","journal-title":"Technical Report ECRC-92-18"},{"key":"10.1016\/0743-1066(93)90047-K_BIB11","series-title":"IEEE Symposium on Logic Programming","first-page":"88","article-title":"Logic Programming: Further Developments","author":"Gallaire","year":"1985"},{"key":"10.1016\/0743-1066(93)90047-K_BIB12","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1145\/321296.321300","article-title":"Backtrack Programming","volume":"12","author":"Golomb","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(93)90047-K_BIB13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing Tree Search Efficiency for Constraint Satisfaction Problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90047-K_BIB14","series-title":"Proceedings of the 7th International Conference on Logic Programming","first-page":"31","article-title":"Kernal Andorra Prolog and Its Computation Model","author":"Haridi","year":"1990"},{"key":"10.1016\/0743-1066(93)90047-K_BIB15","series-title":"Draft Technical Report","article-title":"Constraint Logic Programming","author":"Jaffar","year":"1986"},{"key":"10.1016\/0743-1066(93)90047-K_BIB16","doi-asserted-by":"crossref","DOI":"10.1145\/41625.41635","article-title":"Constraint Logic Programming","author":"Jaffar","year":"1987","journal-title":"Proceedings of the Fourteenth ACM Symposium on Principles of Programming Languages (POPL'87)"},{"key":"10.1016\/0743-1066(93)90047-K_BIB17","series-title":"Logic for Problem Solving","author":"Kowalski","year":"1979"},{"key":"10.1016\/0743-1066(93)90047-K_BIB18","article-title":"Boosting an Application via Constraints Prototyping and-or Parallelism","author":"Le Provost","year":"1993","journal-title":"ECRC report"},{"key":"10.1016\/0743-1066(93)90047-K_BIB19","article-title":"Temporal Reasoning and Constraint Solving","author":"Lever","year":"1992","journal-title":"Esprit Deliverable Report CHIC D 4.1.1"},{"key":"10.1016\/0743-1066(93)90047-K_BIB20","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"issue":"1","key":"10.1016\/0743-1066(93)90047-K_BIB21","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":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90047-K_BIB22","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\/0743-1066(93)90047-K_BIB23_1","first-page":"858","article-title":"Logic Semantics for a Class of Committed-Choice Programs","author":"Maher","year":"1987","journal-title":"Proceedings of the 4th International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(93)90047-K_BIB23_2","series-title":"Proceedings of the 4th International Conference on Logic Programming","first-page":"858","article-title":"Logic Semantics for a Class of Committed-Choice Programs","author":"Maher","year":"1987"},{"key":"10.1016\/0743-1066(93)90047-K_BIB24","series-title":"Proceedings of the 5th International Conference and Symposium on Logic Programming","first-page":"909","article-title":"Most Specific Logic Programs","author":"Marriott","year":"1988"},{"key":"10.1016\/0743-1066(93)90047-K_BIB25","series-title":"Information Processing 89","article-title":"Sepia\u2014An Extendible Prolog System","author":"Maier","year":"1989"},{"key":"10.1016\/0743-1066(93)90047-K_BIB26","series-title":"Technical Report Draft","article-title":"Experiments on the Running Time Behavior of Some Algorithms Solving Propositional Calculus Problems","author":"Mitterreiter","year":"1991"},{"issue":"2","key":"10.1016\/0743-1066(93)90047-K_BIB27","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\/0743-1066(93)90047-K_BIB28","volume":"Vol. 238","author":"Naish","year":"1986"},{"key":"10.1016\/0743-1066(93)90047-K_BIB29","series-title":"Technical Report TR-379","article-title":"Scene Labelling by Relaxation Operations","author":"Rosenfeld","year":"1975"},{"key":"10.1016\/0743-1066(93)90047-K_BIB30","series-title":"Ph.D. thesis","article-title":"Concurrent Constraint Programming Languages","author":"Saraswat","year":"1989"},{"key":"10.1016\/0743-1066(93)90047-K_BIB31","series-title":"New Aspects of Research for Testing of VLSI Circuits","article-title":"Test Pattern Generation with Logic Programming","author":"Simonis","year":"1988"},{"key":"10.1016\/0743-1066(93)90047-K_BIB32","first-page":"165","article-title":"Using an Extended Prolog for Digital Circuit Design","author":"Simonis","year":"1987","journal-title":"IEEE International Workshop on AI Applications to CAD Systems for Electronics"},{"key":"10.1016\/0743-1066(93)90047-K_BIB33","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-642-73005-4_15","article-title":"Using Logic Programming for Fault Diagnosis in Digital Circuits","author":"Simonis","year":"1987","journal-title":"German Workshop on Artificial Intelligence (GWAI-87)"},{"key":"10.1016\/0743-1066(93)90047-K_BIB34","series-title":"Proceedings of the 2nd International Conference on Algebraic and Logic Programming","article-title":"Propositional Calculus Problems in CHIP","author":"Simonis","year":"1990"},{"key":"10.1016\/0743-1066(93)90047-K_BIB35","series-title":"Proceedings of the IFIP TC10 \/ WG10.2 \/ WG10.5 Workshop on Applied Formal Methods for Correct VLSI Design","article-title":"Circuit Verification in CHIP: Benchmark Results","author":"Simonis","year":"1989"},{"key":"10.1016\/0743-1066(93)90047-K_BIB36","article-title":"Residuation and Guarded Rules for Constraint Logic Programming","author":"Smolka","year":"1991","journal-title":"Technical Report 12"},{"key":"10.1016\/0743-1066(93)90047-K_BIB37","series-title":"Logic Programming Series","article-title":"Constraint Satisfaction in Logic Programming","author":"Van Hentenryck","year":"1989"},{"key":"10.1016\/0743-1066(93)90047-K_BIB38","article-title":"Operational Semantics of Constraint Logic Programming over Finite Domains","author":"Van Hentenryck","year":"1991","journal-title":"Proceedings of PLILP'91"},{"key":"10.1016\/0743-1066(93)90047-K_BIB39","article-title":"Domains in Logic Programming","author":"Van Hentenryck","year":"1986","journal-title":"Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI'86)"},{"key":"10.1016\/0743-1066(93)90047-K_BIB40","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56891-3_23","article-title":"Why and How in the Elipsys OR-Parallel CLP System","author":"Veron","year":"1993","journal-title":"Proceedings of Parallel Architecture and Language Europe"},{"key":"10.1016\/0743-1066(93)90047-K_BIB41","series-title":"The Andorra Model","author":"Warren","year":"1988"},{"key":"10.1016\/0743-1066(93)90047-K_BIB42","author":"Warren","year":"1990","journal-title":"The Extended Andorra Model with Implicit Control"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390047K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390047K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:57:28Z","timestamp":1555113448000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669390047K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":43,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["074310669390047K"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(93)90047-k","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}