{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:58Z","timestamp":1761610438176,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80107-0","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"93-105","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Figaro: Yet Another Constraint Programming Library"],"prefix":"10.1016","volume":"30","author":[{"given":"Martin","family":"Henz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ng","family":"Ka Boon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80107-0_BIB1","unstructured":"Yves Caseau and Fran\u00e7ois Laburthe. CLAIRE: Combining objects and rules for problem solving. In Proceedings of the JICSLP'96 workshop on multi-paradigm logic programming. TU Berlin, 1996."},{"key":"10.1016\/S1571-0661(05)80107-0_BIB2","series-title":"Practical Aspects of Declarative Languages, Second International Workshop, PADL'OO","article-title":"A toolkit for constraint-based inference engines","author":"Chew","year":"2000"},{"key":"10.1016\/S1571-0661(05)80107-0_BIB3","unstructured":"M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, and T. Graf. The constraint logic programming language CHIP. In Proceedings International Conference on Fifth Generation Computer Systems, pages 693-702, Tokyo, Japan, December 1988. Springer-Verlag."},{"key":"10.1016\/S1571-0661(05)80107-0_BIB4","unstructured":"William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Chris S. Mellish, editor, Proceedings of the International Joint Conference on Artificial Intelligence, pages 607-615, Montr\u00e9al, Qu\u00e9bec, Canada, August 1995. Morgan Kaufmann Publishers, San Mateo, CA."},{"year":"1999","series-title":"The OPL Optimization Programming Language","author":"Van Hentenryck","key":"10.1016\/S1571-0661(05)80107-0_BIB5"},{"key":"10.1016\/S1571-0661(05)80107-0_BIB6","unstructured":"Martin Henz and Gert Smolka. Design of a finite domain constraint programming library for ML. draft available at http:\/\/www.comp.nus.edu.sg\/~henz\/drafts\/room.ps, 1999."},{"key":"10.1016\/S1571-0661(05)80107-0_BIB7","unstructured":"ILOG Inc., Mountain View, CA 94043, USA, http:\/\/www.ilog.com. ILOG Solver 4-0, Reference Manual, 1997."},{"key":"10.1016\/S1571-0661(05)80107-0_BIB8","unstructured":"Irvin J. Lustig and Jean-Fran\u00e7ois Puget. Program != program: Constraint programming and its relationship to mathematical programming. white paper of hog Inc., Mountain View, CA 94043, USA, available at http:\/\/www.ilog.com, 1999."},{"key":"10.1016\/S1571-0661(05)80107-0_BIB9","unstructured":"Mozart Consortium. The Mozart Programming System. Documentation and system available from http:\/\/www.mozart-oz.org, Programming Systems Lab, Saarbr\u00fccken, Swedish Institute of Computer Science, Stockholm, and Universit\u00e9 catholique de Louvain, 1999."},{"key":"10.1016\/S1571-0661(05)80107-0_BIB10","unstructured":"Tobias M\u00fcller and J\u00f6rg W\u00fcrtz. Extending a concurrent constraint language by propagators. In Jan Maluszynski, editor, Logic Programming: Proceedings of the 1997 International Symposium pages 149-163, Long Island, NY, USA, 1997. The MIT Press."},{"key":"10.1016\/S1571-0661(05)80107-0_BIB11","unstructured":"Jean-Fran\u00e7ois Puget. PECOS: A high level constraint programming language. In Proceedings of the First Singapore International Conference on Intelligent Systems (SPICIS), pages 137-142, Singapore, September\/October 1992."},{"key":"10.1016\/S1571-0661(05)80107-0_BIB12","doi-asserted-by":"crossref","unstructured":"Christian Schulte. Programming constraint inference engines. In Gert Smolka, editor, Principles and Practice of Constraint Programming \u2014 CP97, Proceedings of the Third International Conference, Lecture Notes in Computer Science 1330, pages 519-533, Schloss Hagenberg, Linz, Austria, October\/November 1997. Springer-Verlag, Berlin.","DOI":"10.1007\/BFb0017464"},{"key":"10.1016\/S1571-0661(05)80107-0_BIB13","unstructured":"Christian Schulte. Comparing trailing and copying for constraint programming. In Proceedings of the International Conference on Logic Programming, 1999. to appear."},{"key":"10.1016\/S1571-0661(05)80107-0_BIB14","series-title":"Computer Science Today. Lecture Notes in Computer Science 1000","first-page":"324","article-title":"The Oz programming model","author":"Smolka","year":"1995"},{"key":"10.1016\/S1571-0661(05)80107-0_BIB15","first-page":"14882","article-title":"The Standard Template Library","author":"Stepanov","year":"1995","journal-title":"Hewlett Packard, STL has since been incorporated into the C++ standard, ISO\/IEC"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801070?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801070?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:25Z","timestamp":1761610105000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000]]}},"alternative-id":["S1571066105801070"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80107-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Figaro: Yet Another Constraint Programming Library","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80107-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}