{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:24:11Z","timestamp":1725495851374},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540652243"},{"type":"electronic","value":"9783540494812"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49481-2_29","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:46:10Z","timestamp":1195933570000},"page":"400-416","source":"Crossref","is-referenced-by-count":1,"title":["Linear concurrent constraint programming over reals"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Schachter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"29_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of Coordination","author":"E. Best","year":"1997","unstructured":"E. Best, F.S. de Boer, and C. Palamidessi. Concurrent constraint programming with information removal. In Proceedings of Coordination, LNCS. Springer-Verlag, 1997."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"P. Borovansky, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. Elan: a logical framework based on computational system. In Proceedings of the First International Workshop on Rewriting Logic, volume Volume 4 of electronic notes in TCS, 1996.","DOI":"10.1016\/S1571-0661(04)00032-5"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"C. Kirchner and C. Ringeissen. Rule-based constraint programming. Preprint, 1998.","DOI":"10.3233\/FI-1998-34302"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"F. Fages, P. Ruet, and S. Soliman. Phase semantics and verification of concurrent constraint programs. In LICS, 1998.","DOI":"10.1109\/LICS.1998.705651"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"J.Y. Girard. Linear logic. Theoretical Computer Science, 50(1), 1987.","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"29_CR6","unstructured":"P. Van Hentenryck, V.A. Saraswat, and Y. Deville. Constraint processing in cc(FD). Draft, 1991."},{"key":"29_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of TAPSOFT","author":"J.-L. Lassez","year":"1989","unstructured":"J-L. Lassez and K. McAloon. Independance of negative constraints. In Springer, editor, Proceedings of TAPSOFT, LNCS, 1989."},{"key":"29_CR8","unstructured":"J.L. Lassez and K. McAloon. A canonical form for generalized linear constraints. Journal of Symbolic Computation, 1989."},{"key":"29_CR9","unstructured":"J.R. Shoenfield. Mathematical Logic. Addison-Wesley, 1967."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"K. Fukuda and T. Terlaky. Criss-cross methods: a fresh view on pivot algorithms. Submitted to Elsevier Preprint, 1997.","DOI":"10.1007\/BF02614325"},{"key":"29_CR11","unstructured":"P. Lincoln and V.A. Saraswat. Proofs as concurrent processes. Draft, 1991."},{"key":"29_CR12","unstructured":"P. Refalo. Resolution et implication de contraintes lineaires en programmation logique par contraintes. PhD thesis, Universite de la Mediterrannee, 1997."},{"key":"29_CR13","volume-title":"Logique non-commutative et programmation concurrente par contraintes","author":"P. Ruet","year":"1997","unstructured":"P. Ruet. Logique non-commutative et programmation concurrente par contraintes. PhD thesis, Universit\u00e9 Denis Diderot, Paris 7, 1997."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat and P. Lincoln. Higher-order linear concurrent constraint programming. Technical report, Xerox Parc, 1992.","DOI":"10.7551\/mitpress\/2086.001.0001"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In POPL\u201991: Proceedings 18th ACM Symposium on Principles of Programming Languages, 1991.","DOI":"10.1145\/99583.99627"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"T. Fruhwirth, S. Abdennadher, and H. Meuss. Conuence and semantics of constraint handling rules. Constraint Journal (submitted), 1997.","DOI":"10.1007\/978-3-642-59115-0_7"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49481-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T17:21:27Z","timestamp":1588094487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49481-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540652243","9783540494812"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-49481-2_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}