{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:05:40Z","timestamp":1742958340126,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417392"},{"type":"electronic","value":"9783540447160"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44716-4_9","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T18:16:34Z","timestamp":1187201794000},"page":"138-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Effective Bottom-Up Semantics for First-Order Linear Logic Programs"],"prefix":"10.1007","author":[{"given":"Marco","family":"Bozzano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Delzanno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Martelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,21]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"P. A. Abdulla, K. Cer\u0101ns, B. Jonsson and Y.-K. Tsay. General Decidability Theorems for Infinite-State Systems. In Proc. of LICS 96, pages 313\u2013321, 1996.","key":"9_CR1","DOI":"10.1109\/LICS.1996.561359"},{"unstructured":"P. A. Abdulla, and B. Jonsson. Ensuring Completeness of Symbolic Verification Methods for Infinite-State Systems. To appear in Theoretical Computer Science, 1999.","key":"9_CR2"},{"doi-asserted-by":"crossref","unstructured":"P. A. Abdulla, and A. Nylen. Better is Better than Well: On Efficient Verification of Infinite-State Systems. In Proc. LICS\u20192000, pages 132\u2013140, 2000.","key":"9_CR3","DOI":"10.1109\/LICS.2000.855762"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J. M. Andreoli","year":"1992","unstructured":"J. M. Andreoli. Logic Programming with Focusing proofs in Linear Logic. Journal of Logic and Computation, 2(3):297\u2013347, 1992.","journal-title":"Journal of Logic and Computation"},{"unstructured":"J. M. Andreoli and R. Pareschi. Linear Objects: Logical Processes with Built-In Inheritance. In Proc. of ICLP\u201990, pages 495\u2013510, 1990.","key":"9_CR5"},{"unstructured":"J. M. Andreoli, R. Pareschi and T. Castagnetti. Abstract Interpretation of Linear Logic Programming. In Proc. of ILPS\u201993, pages 295\u2013314, 1993.","key":"9_CR6"},{"doi-asserted-by":"crossref","unstructured":"M. Bozzano, G. Delzanno, and M. Martelli. A Bottom-up semantics for Linear Logic Programs. In Proc. of PPDP 2000, pages 92\u2013102, 2000.","key":"9_CR7","DOI":"10.1145\/351268.351279"},{"key":"9_CR8","series-title":"Technical Report","volume-title":"An Effective Bottom-Up Semantics for First-Order Linear Logic Programs and its Relationship with Decidability Results for Timed Petri Nets","author":"M. Bozzano","year":"2000","unstructured":"M. Bozzano, G. Delzanno, and M. Martelli. An Effective Bottom-Up Semantics for First-Order Linear Logic Programs and its Relationship with Decidability Results for Timed Petri Nets. Technical Report, DISI, UniVersit\u00e0 di Genova, Decemeber 2000."},{"unstructured":"I. Cervesato. Petri Nets and Linear Logic: a Case Study for Logic Programming. In Proc. of GULP-PRODE\u201995, pages 313\u2013318, 1995.","key":"9_CR9"},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-49059-0_16","volume-title":"Proc. of TACAS\u201999","author":"G. Delzanno","year":"1999","unstructured":"G. Delzanno and A. Podelski. Model Checking in CLP. In Proc. of TACAS\u201999, LNCS 1579, pages 223\u2013239, 1999."},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/inco.1993.1015","volume":"102","author":"M. Falaschi","year":"1993","unstructured":"M. Falaschi and G. Levi and M. Martelli and C. Palamidessi. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation, 102(1):86\u2013113, 1993.","journal-title":"Information and Computation"},{"key":"9_CR12","series-title":"Technical Report LSV-98-4","volume-title":"Well-structured Transition Systems Everywhere!","author":"A. Finkel","year":"1999","unstructured":"A. Finkel and P. Schnoebelen. Well-structured Transition Systems Everywhere! Technical Report LSV-98-4, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, 1998. To appear in Theoretical Computer Science, 1999."},{"doi-asserted-by":"crossref","unstructured":"L. Fribourg. Constraint logic programming applied to model checking. In Proc. LOPSTR\u201999, pages 31\u201342, 2000.","key":"9_CR13","DOI":"10.1007\/10720327_3"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/logcom\/5.2.133","volume":"5","author":"M. Gabbrielli","year":"1995","unstructured":"M. Gabbrielli, M. G. Dore and G. Levi. Observable Semantics for Constraint Logic Programs. Journal of Logic and Computation, 5(2): 133\u2013171, 1995.","journal-title":"Journal of Logic and Computation"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J. Y. Girard","year":"1987","unstructured":"J. Y. Girard. Linear Logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J. S. Hodas","year":"1994","unstructured":"J. S. Hodas and D. Miller. Logic Programming in a Fragment of Intuitionistic Linear Logic. Information and Computation, 110(2):327\u2013365, 1994.","journal-title":"Information and Computation"},{"unstructured":"J. Harland and M. Winiko. Making Logic Programs Reactive. In Proc. of JICSLP\u201998 Workshop Dynamics\u201998, pages 43\u201358, 1998.","key":"9_CR17"},{"key":"9_CR18","doi-asserted-by":"publisher","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. Journal of Logic Programming, 19-20:503\u2013582, 1994.","journal-title":"Journal of Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"M. I. Kanovich. Petri Nets, Horn Programs, Linear Logic, and Vector Games. In Proc TACS. \u201994, pages 642\u2013666, 1994.","key":"9_CR19","DOI":"10.1007\/3-540-57887-0_119"},{"doi-asserted-by":"crossref","unstructured":"Y. Kesten, O. Maler, M. Marcus, A. Pnueli, E. Shahar. Symbolic Model Checking with Rich Assertional Languages. In Proc. CAV \u201997, pages 424\u2013435, 1997.","key":"9_CR20","DOI":"10.1007\/3-540-63166-6_41"},{"unstructured":"A. P. Kopylov. Propositional Linear Logic with Weakening is Decidable. In Proc. LICS 95, pages 496\u2013504, 1995.","key":"9_CR21"},{"doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","key":"9_CR22","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1017\/S0960129500000062","volume":"1","author":"N. Mart\u00ec-Oliet","year":"1991","unstructured":"N. Mart\u00ec-Oliet, J. Meseguer. From Petri Nets to Linear Logic. Mathematcal Structures in Computer Science 1(1):69\u2013101, 1991.","journal-title":"Mathematcal Structures in Computer Science"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(96)00045-X","volume":"165","author":"D. Miller","year":"1996","unstructured":"D. Miller. Forum: A Multiple-Conclusion Specification Logic. Theoretical Computer Science, 165(1):201\u2013232, 1996.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44716-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T10:55:16Z","timestamp":1737370516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44716-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417392","9783540447160"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44716-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"21 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}