{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:25:38Z","timestamp":1725560738453},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292388"},{"type":"electronic","value":"9783540320500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564751_13","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T13:31:28Z","timestamp":1129642288000},"page":"137-151","source":"Crossref","is-referenced-by-count":14,"title":["A Linear-Logic Semantics for Constraint Handling Rules"],"prefix":"10.1007","author":[{"given":"Hariolf","family":"Betz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thom","family":"Fr\u00fchwirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Essentials of constraint programming","author":"S. Abdennadher","year":"2003","unstructured":"Abdennadher, S., Fr\u00fchwirth, T.: Essentials of constraint programming. Springer, Heidelberg (2003)"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1009842826135","volume":"4","author":"S. Abdennadher","year":"1999","unstructured":"Abdennadher, S., Fr\u00fchwirth, T., Meuss, H.: Confluence and semantics of constraint simplification rules. Constraints\u00a04(2), 133\u2013165 (1999)","journal-title":"Constraints"},{"issue":"10","key":"13_CR3","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/97946.97953","volume":"25","author":"J.-M. Andreoli","year":"1990","unstructured":"Andreoli, J.-M., Pareschi, R.: LO and Behold! Concurrent Structured Processes. ACM SIGPLAN Notices, Proceedings OOPSLA\/ECOOP 1990\u00a025(10), 44\u201356 (1990)","journal-title":"ACM SIGPLAN Notices, Proceedings OOPSLA\/ECOOP 1990"},{"key":"13_CR4","unstructured":"Betz, H.: A Linear Logic Semantics for CHR, Master Thesis, University of Ulm (October 2004), www.informatik.uni-ulm.de\/pm\/mitarbeiter\/fruehwirth\/other\/betzdipl.ps.gz"},{"key":"13_CR5","unstructured":"Bozzano, M., Delzanno, G., Martelli, M.: A Linear Logic Specification of Chimera. In: Proceedings of the DYNAMICS 1997, a satellite workshop of ILPS 1997 (1997)"},{"key":"13_CR6","unstructured":"Danos, V., Di Cosmo, R.: Initiation to Linear Logic. Course notes (June 1992)"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1006\/inco.2000.3002","volume":"165","author":"F.C. Fages","year":"2001","unstructured":"Fages, F.c., Ruet, P., Soliman, S.: Linear Concurrent Constraint Programming: Operational and Phase Semantics. Information and Computation\u00a0165(1), 14\u201341 (2001)","journal-title":"Information and Computation"},{"issue":"1-3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming\u00a037(1-3), 95\u2013138 (1998)","journal-title":"Journal of Logic Programming"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: Optimal Union-Find in Constraint Handling Rules - Programming Pearl. Theory and Practice of Logic Programming (TPLP) (to appear 2005)","DOI":"10.1017\/S1471068405002541"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear Logic: Its syntax and semantics. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Harland, J., Pym, D., Winikoff, M.: Programming in Lygon: an overview. In: Algebraic Methodology and Software Technology (AMAST 1996), 5th International Conference, Proceedings, pp. 391\u2013405 (1996)","DOI":"10.1007\/BFb0014329"},{"key":"13_CR12","unstructured":"Pfenning, F.: Linear Logic. Material for the homonymous course at Carnegie Mellon University (Draft of 2002)"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. Journal of the ACM\u00a031(2), 245\u2013281 (1984)","journal-title":"Journal of the ACM"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 1993","author":"P. Wadler","year":"1993","unstructured":"Wadler, P.: A taste of linear logic. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564751_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T17:04:58Z","timestamp":1626627898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11564751_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}