{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:41:09Z","timestamp":1770288069916,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705826","type":"print"},{"value":"9783540705833","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_28","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"336-347","source":"Crossref","is-referenced-by-count":5,"title":["Linear Logical Algorithms"],"prefix":"10.1007","author":[{"given":"Robert J.","family":"Simmons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Pfenning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1145\/581771.581774","volume":"49","author":"D.A. McAllester","year":"2002","unstructured":"McAllester, D.A.: On the complexity analysis of static analyses. J. ACM\u00a049(4), 512\u2013537 (2002)","journal-title":"J. ACM"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45927-8_18","volume-title":"Programming Languages and Systems","author":"F. Nielson","year":"2002","unstructured":"Nielson, F., Nielson, H.R., Seidl, H.: Automatic complexity analysis. In: Le M\u00e9tayer, D. (ed.) ESOP 2002 and ETAPS 2002. LNCS, vol.\u00a02305, pp. 243\u2013261. Springer, Heidelberg (2002)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/888251.888268","volume-title":"PPDP 2003: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming","author":"Y.A. Liu","year":"2003","unstructured":"Liu, Y.A., Stoller, S.D.: From Datalog rules to efficient programs with time and space guarantees. In: PPDP 2003: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, pp. 172\u2013183. ACM, New York (2003)"},{"key":"28_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45744-5_44","volume-title":"Automated Reasoning","author":"H. Ganzinger","year":"2001","unstructured":"Ganzinger, H., McAllester, D.A.: A new meta-complexity theorem for bottom-up logic programs. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 514\u2013528. Springer, Heidelberg (2001)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-45619-8_15","volume-title":"Logic Programming","author":"H. Ganzinger","year":"2002","unstructured":"Ganzinger, H., McAllester, D.A.: Logical algorithms. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 209\u2013223. Springer, Heidelberg (2002)"},{"issue":"4","key":"28_CR6","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1017\/S1471068401001090","volume":"1","author":"S. Greco","year":"2001","unstructured":"Greco, S., Zaniolo, C.: Greedy algorithms in Datalog. Theory Pract. Log. Program.\u00a01(4), 381\u2013407 (2001)","journal-title":"Theory Pract. Log. Program."},{"key":"28_CR7","unstructured":"Chang, B.Y.E., Chaudhuri, K., Pfenning, F.: A judgmental analysis of linear logic. Technical Report CMU-CS-03-131, Carnegie Mellon University (April 2003)"},{"issue":"2-3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2005.05.014","volume":"342","author":"C. Nomikos","year":"2005","unstructured":"Nomikos, C., Rondogiannis, P., Gergatsoulis, M.: Temporal stratification tests for linear and branching-time deductive databases. Theor. Comput. Sci.\u00a0342(2-3), 382\u2013415 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"28_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1017\/S1471068402001515","volume":"3","author":"F. Arni","year":"2003","unstructured":"Arni, F., Ong, K., Tsur, S., Wang, H., Zaniolo, C.: The Deductive Database System LDL++. Theory Pract. Log. Program.\u00a03(1), 61\u201394 (2003)","journal-title":"Theory Pract. Log. Program."},{"key":"28_CR10","unstructured":"Pfenning, F.: Linear logical algorithms. In: Workshop on Programming Logics in memory of Harald Ganzinger, Saarbr\u00fccken (June 2005) (invited talk)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1069774.1069778","volume-title":"PPDP 2005: Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming","author":"P. L\u00f3pez","year":"2005","unstructured":"L\u00f3pez, P., Pfenning, F., Polakow, J., Watkins, K.: Monadic concurrent linear logic programming. In: PPDP 2005: Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 35\u201346. ACM, New York (2005)"},{"key":"28_CR12","unstructured":"Chaudhuri, K.: The Focused Inverse Method for Linear Logic. PhD thesis, Carnegie Mellon University (December 2006)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11814771_9","volume-title":"Automated Reasoning","author":"K. Chaudhuri","year":"2006","unstructured":"Chaudhuri, K., Pfenning, F., Price, G.: A Logical Characterization of Forward and Backward Chaining in the Inverse Method. In: Automated Reasoning, vol.\u00a04130, pp. 97\u2013111. Springer, Heidelberg (2006)"},{"key":"28_CR14","unstructured":"Simmons, R.J., Pfenning, F.: Linear Logical Algorithms. Technical Report CMU-CS-08-104, Carnegie Mellon University (May 2008)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:34Z","timestamp":1620015814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}