{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:12:40Z","timestamp":1725862360549},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662529201"},{"type":"electronic","value":"9783662529218"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-52921-8_16","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T11:22:30Z","timestamp":1470396150000},"page":"249-264","source":"Crossref","is-referenced-by-count":0,"title":["True Concurrency of Deep Inference Proofs"],"prefix":"10.1007","author":[{"given":"Ozan","family":"Kahramano\u011fullar\u0131","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"issue":"14","key":"16_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1462179.1462186","volume":"2","author":"P Bruscoli","year":"2009","unstructured":"Bruscoli, P., Guglielmi, A.: On the proof complexity of deep inference. ACM Trans. Computat. Logic 2(14), 1\u201334 (2009)","journal-title":"ACM Trans. Computat. Logic"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Linear logic: Its syntax and semantics. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic (Proceedings of the Workshop on Linear Logic, Cornell University), vol. 222. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511629150"},{"key":"16_CR3","unstructured":"Guglielmi, A.: Abstract Logic Programming in Linear Logic Independence and Causality in a First Order Calculus. Ph.D. thesis, Universita di Pisa (1996)"},{"issue":"1","key":"16_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1182613.1182614","volume":"8","author":"A Guglielmi","year":"2007","unstructured":"Guglielmi, A.: A system of interaction and structure. ACM Trans. Comput. Logic 8(1), 1\u201364 (2007)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"1:9","key":"16_CR5","first-page":"1","volume":"4","author":"A Guglielmi","year":"2008","unstructured":"Guglielmi, A., Gundersen, T.: Normalisation control in deep inference via atomic flows. Log. Methods Comput. Sci. 4(1:9), 1\u201336 (2008)","journal-title":"Log. Methods Comput. Sci."},{"key":"16_CR6","unstructured":"Guglielmi, A., Gundersen, T., Parigot, M.: A proof calculus which reduces syntactic bureaucracy. In: Proceedings of the International Conference on Rewriting Techniques and Applications 2010 (Edinburgh), pp. 135\u2013150. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2010 LIPIcs (2010)"},{"issue":"1\u20133","key":"16_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.apal.2007.11.005","volume":"152","author":"O Kahramano\u011fullar\u0131","year":"2008","unstructured":"Kahramano\u011fullar\u0131, O.: System BV is NP-complete. Ann. Pure Appl. Logic 152(1\u20133), 107\u2013121 (2008)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"11","key":"16_CR8","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1016\/j.ic.2009.02.008","volume":"207","author":"O Kahramano\u011fullar\u0131","year":"2009","unstructured":"Kahramano\u011fullar\u0131, O.: On linear logic planning and concurrency. Inform. Comput. 207(11), 1229\u20131258 (2009)","journal-title":"Inform. Comput."},{"issue":"2:5","key":"16_CR9","first-page":"1","volume":"10","author":"O Kahramano\u011fullar\u0131","year":"2014","unstructured":"Kahramano\u011fullar\u0131, O.: Interaction and depth against nondeterminism in proof search. Log. Methods Comput. Sci. 10(2:5), 1\u201349 (2014)","journal-title":"Log. Methods Comput. Sci."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Kahramano\u011fullar\u0131, O.: Maude as a platform for designing and implementing deep inference systems. In: Proceedings of the Eighth International Workshop on Rule-Based Programming, RULE 2007. ENTCS, vol. 219, pp. 35\u201350. Elsevier (2008)","DOI":"10.1016\/j.entcs.2008.10.033"},{"key":"16_CR11","unstructured":"Kanovich, M.: The multiplicative fragment of linear logic is NP-complete. Technical Report X-91-13, Institute for Language, Logic, and Information (1991)"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(96)00045-X","volume":"165","author":"D Miller","year":"1996","unstructured":"Miller, D.: Forum: a multiple-conclusion specification logic. Theor. Comput. Sci. 165, 201\u2013232 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR13","series-title":"London Mathematical Society Lecture Note","volume-title":"Linear Logic in Computer Science","author":"D Miller","year":"2004","unstructured":"Miller, D.: Overview of linear logic programming. In: Ehrhard, T., Girard, J.-Y., Ruet, P., Scott, P. (eds.) Linear Logic in Computer Science. London Mathematical Society Lecture Note, vol. 316. Cambridge University Press, Cambridge (2004)"},{"issue":"1\u20132","key":"16_CR14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0304-3975(96)80710-9","volume":"170","author":"V Sassone","year":"1996","unstructured":"Sassone, V., Nielsen, M., Winskel, G.: Models for concurrency: towards a classification. Theor. Comput. Sci. 170(1\u20132), 297\u2013348 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"16_CR15","first-page":"1","volume":"12","author":"L Strassburger","year":"2011","unstructured":"Strassburger, L., Guglielmi, A.: A system of interaction and structure IV: The exponentials anddecomposition. ACM Trans. Comp. Logic 12(4), 1\u201339 (2011)","journal-title":"ACM Trans. Comp. Logic"},{"key":"16_CR16","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"G Winskel","year":"1995","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 4, pp. 1\u2013148. Oxford University Press, Oxford (1995)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-52921-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T03:13:22Z","timestamp":1568258002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-52921-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662529201","9783662529218"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-52921-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}