{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:38:38Z","timestamp":1725633518836},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353079"},{"type":"electronic","value":"9783642353086"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35308-6_17","type":"book-chapter","created":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T22:20:18Z","timestamp":1352326818000},"page":"208-223","source":"Crossref","is-referenced-by-count":1,"title":["Compact Proof Certificates for Linear Logic"],"prefix":"10.1007","author":[{"given":"Kaustuv","family":"Chaudhuri","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"J. of Logic and Computation"},{"key":"17_CR2","unstructured":"Boespflug, M.: Conception d\u2019un noyau de v\u00e9rification de preuves pour le \u03bb\u03a0-calcul modulo. PhD thesis, Ecole Polytechnique (2011)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-16242-8_12","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Brock-Nannestad","year":"2010","unstructured":"Brock-Nannestad, T., Sch\u00fcrmann, C.: Focused Natural Deduction. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 157\u2013171. Springer, Heidelberg (2010)"},{"key":"17_CR4","unstructured":"Chaudhuri, K.: The Focused Inverse Method for Linear Logic. PhD thesis, Carnegie Mellon University, Technical report CMU-CS-06-162 (December 2006)"},{"key":"17_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-89439-1_33","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K. Chaudhuri","year":"2008","unstructured":"Chaudhuri, K.: Focusing Strategies in the Sequent Calculus of Synthetic Connectives. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 467\u2013481. Springer, Heidelberg (2008)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-16242-8_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K. Chaudhuri","year":"2010","unstructured":"Chaudhuri, K.: Magically Constraining the Inverse Method Using Dynamic Polarity Assignment. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 202\u2013216. Springer, Heidelberg (2010)"},{"key":"17_CR7","unstructured":"Chaudhuri, K., Guenot, N., Stra\u00dfburger, L.: The Focused Calculus of Structures. In: Computer Science Logic: 20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), pp. 159\u2013173. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (September 2011)"},{"issue":"2-3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10817-007-9091-0","volume":"40","author":"K. Chaudhuri","year":"2008","unstructured":"Chaudhuri, K., Pfenning, F., Price, G.: A logical characterization of forward and backward chaining in the inverse method. J. of Automated Reasoning\u00a040(2-3), 133\u2013177 (2008)","journal-title":"J. of Automated Reasoning"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"795","DOI":"10.2307\/2275431","volume":"57","author":"R. Dyckhoff","year":"1992","unstructured":"Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. J. of Symbolic Logic\u00a057(3), 795\u2013807 (1992)","journal-title":"J. of Symbolic Logic"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J. Hodas","year":"1994","unstructured":"Hodas, J., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Information and Computation\u00a0110(2), 327\u2013365 (1994)","journal-title":"Information and Computation"},{"key":"17_CR11","unstructured":"Hodas, J., Watkins, K., Tamura, N., Kang, K.-S.: Efficient implementation of a linear logic programming language. In: Jaffar, J. (ed.) Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, pp. 145\u2013159 (1998)"},{"key":"17_CR12","unstructured":"Laurent, O.: Etude de la polarisation en logique. PhD thesis, Universit\u00e9 Aix-Marseille\u00a0II (March 2002)"},{"key":"17_CR13","unstructured":"Laurent, O.: A proof of the focalization property of linear logic (May 2004) (unpublished note)"},{"issue":"46","key":"17_CR14","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1016\/j.tcs.2009.07.041","volume":"410","author":"C. Liang","year":"2009","unstructured":"Liang, C., Miller, D.: Focusing and polarization in linear, intuitionistic, and classical logics. Theoretical Computer Science\u00a0410(46), 4747\u20134768 (2009)","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0168-0072(92)90075-B","volume":"56","author":"P. Lincoln","year":"1992","unstructured":"Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Annals Pure Applied Logic\u00a056, 239\u2013311 (1992)","journal-title":"Annals Pure Applied Logic"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-25379-9_6","volume-title":"Certified Programs and Proofs","author":"D. Miller","year":"2011","unstructured":"Miller, D.: A Proposal for Broad Spectrum Proof Certificates. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol.\u00a07086, pp. 54\u201369. Springer, Heidelberg (2011)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-74915-8_31","volume-title":"Computer Science Logic","author":"D. Miller","year":"2007","unstructured":"Miller, D., Saurin, A.: From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 405\u2013419. Springer, Heidelberg (2007)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Proof-carrying code. In: Conference Record of the 24th Symposium on Principles of Programming Languages 1997, Paris, France, pp. 106\u2013119. ACM Press (1997)","DOI":"10.1145\/263699.263712"},{"key":"17_CR19","unstructured":"Stra\u00dfburger, L.: Linear Logic and Noncommutativity in the Calculus of Structures. PhD thesis, Technische Universit\u00e4t Dresden (2003)"}],"container-title":["Lecture Notes in Computer Science","Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35308-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:13:46Z","timestamp":1620119626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35308-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353079","9783642353086"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35308-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}