{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:44:32Z","timestamp":1725806672259},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319127354"},{"type":"electronic","value":"9783319127361"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12736-1_3","type":"book-chapter","created":{"date-parts":[[2014,10,13]],"date-time":"2014-10-13T10:53:24Z","timestamp":1413197604000},"page":"39-57","source":"Crossref","is-referenced-by-count":3,"title":["Logic Programming and Logarithmic Space"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Aubert","sequence":"first","affiliation":[]},{"given":"Marc","family":"Bagnol","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Pistone","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Seiller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Asperti, A., Danos, V., Laneve, C., Regnier, L.: Paths in the lambda-calculus. In: LICS, pp. 426\u2013436. IEEE Computer Society (1994)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-08918-8_6","volume-title":"Rewriting and Typed Lambda Calculi","author":"C. Aubert","year":"2014","unstructured":"Aubert, C., Bagnol, M.: Unification and logarithmic space. In: Dowek, G. (ed.) RTA-TLCA 2014. LNCS, vol.\u00a08560, pp. 77\u201392. Springer, Heidelberg (2014)"},{"key":"3_CR3","unstructured":"Aubert, C., Seiller, T.: Characterizing co-nl by a group action. Arxiv preprint abs\/1209.3422 (2012)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445\u2013532. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.tcs.2009.09.015","volume":"411","author":"P. Baillot","year":"2010","unstructured":"Baillot, P., Mazza, D.: Linear logic by levels and bounded time complexity. Theoret. Comput. Sci.\u00a0411(2), 470\u2013503 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"3_CR6","first-page":"1","volume":"45","author":"P. Baillot","year":"2001","unstructured":"Baillot, P., Pedicini, M.: Elementary complexity and geometry of interaction. Fund. Inform.\u00a045(1-2), 1\u201331 (2001)","journal-title":"Fund. Inform."},{"issue":"2","key":"3_CR7","first-page":"115","volume":"55","author":"M. Bellia","year":"2003","unstructured":"Bellia, M., Occhiuto, M.E.: N-axioms parallel unification. Fund. Inform.\u00a055(2), 115\u2013128 (2003)","journal-title":"Fund. Inform."},{"key":"3_CR8","first-page":"88","volume":"26","author":"A.M. Ben-Amram","year":"1995","unstructured":"Ben-Amram, A.M.: What is a \u201cpointer machine\u201d? Science of Computer Programming\u00a026, 88\u201395 (1995)","journal-title":"Science of Computer Programming"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-89982-2_37","volume-title":"Logic Programming","author":"F. Calimeri","year":"2008","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable functions in ASP: Theory and implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 407\u2013424. Springer, Heidelberg (2008)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Dal Lago, U., Hofmann, M.: Bounded linear logic, revisited. Log. Meth. Comput. Sci.\u00a06(4) (2010)","DOI":"10.2168\/LMCS-6(4:7)2010"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E. Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv.\u00a033(3), 374\u2013425 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","volume":"1","author":"C. Dwork","year":"1984","unstructured":"Dwork, C., Kanellakis, P.C., Mitchell, J.C.: On the sequential nature of unification. J. Log. Program.\u00a01(1), 35\u201350 (1984)","journal-title":"J. Log. Program."},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1137\/0217046","volume":"17","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Kanellakis, P.C., Stockmeyer, L.J.: Parallel algorithms for term matching. SIAM J. Comput.\u00a017(4), 711\u2013731 (1988)","journal-title":"SIAM J. Comput."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Gaboardi, M., Marion, J.Y., Ronchi Della Rocca, S.: An implicit characterization of pspace. ACM Trans. Comput. Log.\u00a013(2), 18:1\u201318:36 (2012)","DOI":"10.1145\/2159531.2159540"},{"issue":"1","key":"3_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":"Girard, J.Y.: Linear logic. Theoret. Comput. Sci.\u00a050(1), 1\u2013101 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0049-237X(08)70271-4","volume":"127","author":"J.Y. Girard","year":"1989","unstructured":"Girard, J.Y.: Geometry of interaction 1: Interpretation of system F. Studies in Logic and the Foundations of Mathematics\u00a0127, 221\u2013260 (1989)","journal-title":"Studies in Logic and the Foundations of Mathematics"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Girard, J.Y.: Towards a geometry of interaction. In: Gray, J.W., \u0160\u010dedrov, A. (eds.) Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference held, June 14-20. Categories in Computer Science and Logic, vol.\u00a092, pp. 69\u2013108. AMS (1989)","DOI":"10.1090\/conm\/092\/1003197"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Girard, J.Y.: Geometry of interaction III: Accommodating the additives. In: Girard, J.Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Math. Soc. Lecture Note Ser., vol.\u00a0222, pp. 329\u2013389. CUP (1995)","DOI":"10.1017\/CBO9780511629150.017"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-60178-3_83","volume-title":"Logic and Computational Complexity","author":"J.Y. Girard","year":"1995","unstructured":"Girard, J.Y.: Light linear logic. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 145\u2013176. Springer, Heidelberg (1995)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Girard, J.Y.: Normativity in logic. In: Dybjer, P., Lindstrm, S., Palmgren, E., Sundholm, G. (eds.) Epistemology versus Ontology. Logic, Epistemology, and the Unity of Science, vol.\u00a027, pp. 243\u2013263. Springer (2012)","DOI":"10.1007\/978-94-007-4435-6_12"},{"key":"3_CR21","unstructured":"Girard, J.Y.: Three lightings of logic. In: Ronchi Della Rocca, S. (ed.) CSL. LIPIcs, vol.\u00a023, pp. 11\u201323. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2013)"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0743-1066(95)00051-K","volume":"25","author":"G.G. Hillebrand","year":"1995","unstructured":"Hillebrand, G.G., Kanellakis, P.C., Mairson, H.G., Vardi, M.Y.: Undecidable boundedness problems for datalog programs. J. Log. Program.\u00a025(2), 163\u2013190 (1995)","journal-title":"J. Log. Program."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M., Malcher, A.: Multi-head finite automata: Characterizations, concepts and open problems. In: Neary, T., Woods, D., Seda, A.K., Murphy, N. (eds.) CSP. EPTCS, vol.\u00a01, pp. 93\u2013107 (2008)","DOI":"10.4204\/EPTCS.1.9"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"N.D. Jones","year":"1975","unstructured":"Jones, N.D.: Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci.\u00a011(1), 68\u201385 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-45413-6_23","volume-title":"Typed Lambda Calculi and Applications","author":"O. Laurent","year":"2001","unstructured":"Laurent, O.: A token machine for full geometry of interaction (extended abstract). In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 283\u2013297. Springer, Heidelberg (2001)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-02846-5_40","volume-title":"Logic Programming","author":"Y. Lierler","year":"2009","unstructured":"Lierler, Y., Lifschitz, V.: One more decidable class of finitely ground programs. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol.\u00a05649, pp. 489\u2013493. Springer, Heidelberg (2009)"},{"key":"3_CR27","unstructured":"Ohkubo, M., Yasuura, H., Yajima, S.: On parallel computation time of unification for restricted terms. Tech. rep., Kyoto University (1987)"},{"issue":"2-3","key":"3_CR28","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-2013-879","volume":"126","author":"G. Pighizzini","year":"2013","unstructured":"Pighizzini, G.: Two-way finite automata: Old and recent results. Fund. Inform.\u00a0126(2-3), 225\u2013246 (2013)","journal-title":"Fund. Inform."},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM\u00a012(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"key":"3_CR30","unstructured":"Savage, J.E.: Models of computation - exploring the power of computing. Addison-Wesley (1998)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Sch\u00f6pp, U.: Stratified bounded affine logic for logarithmic space. In: LICS, pp. 411\u2013420. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.45"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"1808","DOI":"10.1016\/j.apal.2012.04.005","volume":"163","author":"T. Seiller","year":"2012","unstructured":"Seiller, T.: Interaction graphs: Multiplicatives. Ann. Pure Appl. Logic\u00a0163, 1808\u20131837 (2012)","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12736-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T15:21:51Z","timestamp":1598368911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12736-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319127354","9783319127361"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12736-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}