{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:39:45Z","timestamp":1760708385285},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594796"},{"type":"electronic","value":"9783540492818"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59479-5_28","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:17:40Z","timestamp":1330276660000},"page":"225-245","source":"Crossref","is-referenced-by-count":1,"title":["Semantic properties of CHIP(FD)"],"prefix":"10.1007","author":[{"given":"Gilberto","family":"Fil\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Nardiello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriano","family":"Tirabosco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"13_CR1","volume-title":"Technical Report Memo ATP-18","author":"W.W. Bledsoe","year":"1974","unstructured":"W.W. Bledsoe. The Sup-Inf Method in Presburger Arithmetic. Technical Report Memo ATP-18, University of Texas at Austin, Texas, December (1974)."},{"key":"13_CR2","unstructured":"P. Boizumault, Y. Delon, L. P\u00e9ridy. Solving a Real-life Planning Exams Problem using Constraint Logic Programming. In Constraint Processing \u2014 Proc. of the Int. WS at CSAM'93 (M. Meyer ed.), DFKI Research Report 93-39, pp.106\u2013112, August (1993)."},{"issue":"4","key":"13_CR3","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/2701.2702","volume":"10","author":"A. Bundy","year":"1984","unstructured":"A. Bundy. A Generalized Interval Package and Its Use for Semantic Checking. ACM Trans. on Math. Software, 10(4), pp. 397\u2013409, (1984).","journal-title":"ACM Trans. on Math. Software"},{"key":"13_CR4","unstructured":"CHIP User's Guide. Version 4.0. COSYTEC SA, June, France (1993)."},{"issue":"7","key":"13_CR5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/79204.79210","volume":"33","author":"A. Colmerauer","year":"1990","unstructured":"A. Colmerauer. An Introduction to Prolog III. ACM Comm., 33(7), pp. 70\u201390, July (1990).","journal-title":"ACM Comm."},{"issue":"3","key":"13_CR6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E. Davis","year":"1987","unstructured":"E. Davis. Constraint propagation with interval labels. Artificial Intelligence, 32(3):281\u2013331, July (1987).","journal-title":"Artificial Intelligence"},{"key":"13_CR7","unstructured":"M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving large scheduling problems in logic programming. In EURO-TIMS Joint International Conference on Operations Research and Management Science, Paris, July (1988)."},{"key":"13_CR8","first-page":"42","volume-title":"Solving a Cutting-Stock Problem in Constraint Logic Programming","author":"M. Dincbas","year":"1988","unstructured":"M. Dincbas, H. Simonis, and P. van Hentenryck. Solving a Cutting-Stock Problem in Constraint Logic Programming. In (Robert A. Kowalski and Kenneth A. Bowen, editors), Fifth International Conference on Logic Programming, pages 42\u201358, Seattle, WA, MIT Press, August (1988)."},{"key":"13_CR9","volume-title":"Actes de la Journee Combinatoire de l'AFCET","author":"M. Dincbas","year":"1987","unstructured":"M. Dincbas, H. Simonis, and P. van Hentenryck. An Extension of PROLOG to Solve Combinatorial Problems. In Actes de la Journee Combinatoire de l'AFCET, Paris, France, CNAM, June (1987)."},{"key":"13_CR10","unstructured":"M. Dincbas, H. Simonis, and P. van Hentenryck. A Logic Programming Language to Solve Discrete OR Problems. In 12th Symposium on Operations Research, Passau, Germany, September (1987)."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, and T. Graf. Applications of CHIP to industrial and engineering problems. In First International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, Tullahoma, Tennessee, June (1988).","DOI":"10.1145\/55674.55703"},{"key":"13_CR12","unstructured":"M. Dincbas, P. Van Hentenryck, M. Simonis, A. Aggoun, T. Graf, F. Berthier. The Constraint Logic Programming Language CHIP. In Proc. Int. Conf. on Fifth Generation Computer System (FGCS'88), Tokyo, Japan, December, pp. 693\u2013702 (1988)."},{"issue":"1\u20132","key":"13_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0743-1066(90)90052-7","volume":"8","author":"M. Dincbas","year":"1990","unstructured":"M. Dincbas, M. Simonis, and P. Van Hentenryck. Solving Large Combinatorial Problems in Constraint Logic Programming. Journal of Logic Programming, 8(1\u20132), pp. 75\u201393, (1990).","journal-title":"Journal of Logic Programming"},{"key":"13_CR14","unstructured":"G. Fil\u00e9, G. Nardiello and A. Tirabosco. An Operational Semantics for CHIP. In Proc. of the Eighth Conf. on Logic Programming GULP'93, Gizzeria Lido, Italy, June, pp. 633\u2013647 (1993)."},{"key":"13_CR15","volume-title":"Semantic properties of CHIP(FD): the independence of the computation rule. draft","author":"G. Fil\u00e9","year":"1994","unstructured":"G. Fil\u00e9, G. Nardiello and A. Tirabosco. Semantic properties of CHIP(FD): the independence of the computation rule. draft, Universit\u00e0 di Padova, Italy (1994)."},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"R.M. Haralick and G.L. Elliott. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Art. Int. 14, pp. 263\u2013313, (1980).","journal-title":"Art. Int."},{"key":"13_CR17","volume-title":"Tech. Rep. 86\/73","author":"J. Jaffar","year":"1986","unstructured":"J. Jaffar and J.-L. Lassez. Constraint Logic Programming. Tech. Rep. 86\/73, Monash University, Victoria, Australia, June (1986)."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. 14th ACM Conf. on Priciples of Programming Languages (POPL'87), Munich, January, pp. 111\u2013119 (1987).","DOI":"10.1145\/41625.41635"},{"key":"13_CR19","first-page":"12","volume-title":"Lecture Notes in Computer Science No. 315","author":"J. Jaffar","year":"1987","unstructured":"J. Jaffar and J.-L. Lassez. \u00bfFrom Unification to Constraint. In Proc. 6th Japanise Logic Programming Conf., Tokyo, Japan, June, (1987). Lecture Notes in Computer Science No. 315, Springer-Verlag, Berlin, pp. 12\u201324 (1987)."},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. J. Logic Programming 19\/20 (May\/July), pp. 503\u2013581 (1994).","journal-title":"J. Logic Programming"},{"issue":"3","key":"13_CR21","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J. Jaffar","year":"1992","unstructured":"J. Jaffar, S. Michaylov, P.J. Stuckey and R.H.C. Yap. The CLP(R) Language and System. ACM Trans, on Prog. Lang. and Systems, vol. 14(3), pp. 339\u2013395, (1992).","journal-title":"ACM Trans, on Prog. Lang. and Systems"},{"key":"13_CR22","unstructured":"V. Kumar. Algorithms for Constraint-Satisfaction Problems: A Survey. AI Magazine, pp. 32\u201344, Spring (1992)."},{"key":"13_CR23","volume-title":"Foundation of Deductive Databases and Logic programming","author":"J.-L. Lassez","year":"1988","unstructured":"J.-L. Lassez, M. Maher and K. Marriott. Unification Revisited. In (Minker ed.) Foundation of Deductive Databases and Logic programming, Morgan Kaufmann, Los Altos, CA, (1988)."},{"issue":"1","key":"13_CR24","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J.-L. Lauriere","year":"1978","unstructured":"J.-L. Lauriere. A Language and a program for Stating and Solving Combinatorial Problems. Artificial Intelligence, 10(1), pp. 29\u2013127, (1978).","journal-title":"Artificial Intelligence"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic programming. 2nd edition, Springer-Verlag, (1987).","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"1","key":"13_CR26","first-page":"99","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"A.K. Mackworth. Consistency in Network of Relations. AI Journal, 8(1), pp.99\u2013118, (1977).","journal-title":"AI Journal"},{"key":"13_CR27","volume-title":"Interval Arithmetic","author":"R. Moore","year":"1966","unstructured":"R. Moore. Interval Arithmetic. Prentice-Hall, Englewood Cliffs, NJ, (1966)."},{"issue":"2","key":"13_CR28","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/322123.322137","volume":"26","author":"R. E. Shostak","year":"1979","unstructured":"R. E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351\u2013360, April (1979).","journal-title":"Journal of the ACM"},{"key":"13_CR29","unstructured":"V.A. Saraswat. Concurent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, (to appear by MIT Press), (1989)."},{"key":"13_CR30","unstructured":"E. Tsang. Foundations of Constraint Satisfaction. Academic Press, (1993)."},{"key":"13_CR31","unstructured":"P. Van Hentenryck. A Theoretical Framework for Consistency Techniques in Logic Programming. In Proc. of Int Joint Conf. on Artificial Intelligence (IJCAI-87), pp. 2\u20138, Milan, Italy, August (1987)."},{"key":"13_CR32","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, (1989)."},{"key":"13_CR33","volume-title":"Tech. Rept.","author":"P. Hentenryck Van","year":"1991","unstructured":"P. Van Hentenryck. Constraint Logic Programming. Tech. Rept., Brown Univ., Providence, RI, January (1991)."},{"key":"13_CR34","series-title":"LNCS 528","first-page":"395","volume-title":"Proc. of PLILP'91","author":"P. Hentenryck Van","year":"1991","unstructured":"P. Van Hentenryck and Y. Deville. Operational Semantics for Constraint Logic Programming over Finite Domains. In Proc. of PLILP'91, Passau, Germany, August, LNCS 528, Springer-Verlag, pp. 395\u2013406 (1991)."},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"P. Van Hentenryck, H. Simonis and M. Dincbas. Constraint Satisfaction using Constraint Logic Programming. Artificial Intelligence 58(1\u20133), December (1992).","DOI":"10.1016\/0004-3702(92)90006-J"}],"container-title":["Lecture Notes in Computer Science","Constraint Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59479-5_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:27:21Z","timestamp":1605648441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59479-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594796","9783540492818"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-59479-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}