<bibliography>
 <citation type="article" key="andreoli92jlc">
  <author>Jean-Marc <surname>Andreoli</surname></author>
  <year>1992</year>
  <title>Logic Programming with Focusing Proofs in Linear Logic</title>
  <journal>J. Log. Comput.</journal>
  <volume>2</volume>
  <number>3</number>
  <pages>297&#8211;347</pages>
  <doi>10.1093/logcom/2.3.297</doi>
 </citation>
 <citation type="techreport" key="FILL">
  <author>Torben <surname>Bra&#252;ner</surname></author>
  <author>Valeria <surname>de Paiva</surname></author>
  <year>1996</year>
  <title>Cut-Elimination for Full Intuitionistic Linear Logic</title>
  <type>Technical Report</type>
  <institution>BRICS Report Series</institution>
 </citation>
 <citation type="techreport" key="petri-LL">
  <author>Iliano <surname>Cervesato</surname></author>
  <year>1994</year>
  <title>Petri Nets as Multiset Rewriting Systems in a Linear Framework</title>
  <type>Technical Report</type>
  <institution>Dipartimento di Informatica. Universit&#225; di Torino</institution>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/agp/Cervesato95">
  <author>Iliano <surname>Cervesato</surname></author>
  <year>1995</year>
  <title>Petri Nets and Linear Logic: a Case Study for Logic Programming</title>
  <editor>Mar&#237;a <surname>Alpuente</surname></editor>
  <editor>Maria I. <surname>Sessa</surname></editor>
  <booktitle>1995 Joint Conference on Declarative Programming, GULP-PRODE'95, Marina di Vietri, Italy, September 11-14, 1995</booktitle>
  <pages>313&#8211;320</pages>
 </citation>
 <citation type="article" key="DBLP:journals/tcs/CervesatoHP00">
  <author>Iliano <surname>Cervesato</surname></author>
  <author>Joshua S. <surname>Hodas</surname></author>
  <author>Frank <surname>Pfenning</surname></author>
  <year>2000</year>
  <title>Efficient resource management for linear logic proof search</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>232</volume>
  <number>1-2</number>
  <pages>133&#8211;163</pages>
  <doi>10.1016/S0304-3975(99)00173-5</doi>
 </citation>
 <citation type="article" key="cervesato02ic">
  <author>Iliano <surname>Cervesato</surname></author>
  <author>Frank <surname>Pfenning</surname></author>
  <year>2002</year>
  <title>A Linear Logical Framework</title>
  <journal>Information &#38; Computation</journal>
  <volume>179</volume>
  <number>1</number>
  <pages>19&#8211;75</pages>
  <doi>10.1006/inco.2001.2951</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/cade/ChaudhuriP05">
  <author>Kaustuv <surname>Chaudhuri</surname></author>
  <author>Frank <surname>Pfenning</surname></author>
  <year>2005</year>
  <title>A Focusing Inverse Method Theorem Prover for First-Order Linear Logic</title>
  <editor>Robert <surname>Nieuwenhuis</surname></editor>
  <booktitle>Automated Deduction - CADE-20</booktitle>
  <series>LNCS</series>
  <volume>3632</volume>
  <publisher>Springer</publisher>
  <pages>69&#8211;83</pages>
  <doi>10.1007/11532231_6</doi>
 </citation>
 <citation type="inproceedings" key="ChaudhuriR15">
  <author>Kaustuv <surname>Chaudhuri</surname></author>
  <author>Giselle <surname>Reis</surname></author>
  <year>2015</year>
  <title>An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials</title>
  <booktitle>LPAR-20</booktitle>
  <pages>146&#8211;161</pages>
  <doi>10.1007/978-3-662-48899-7_11</doi>
 </citation>
 <citation type="article" key="DanosJS95">
  <author>Vincent <surname>Danos</surname></author>
  <author>Jean-Baptiste <surname>Joinet</surname></author>
  <author>Harold <surname>Schellinx</surname></author>
  <year>1995</year>
  <title>On the linear decoration of intuitionistic derivations</title>
  <journal>Arch. Math. Log.</journal>
  <volume>33</volume>
  <number>6</number>
  <pages>387&#8211;412</pages>
  <doi>10.1007/BF02390456</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/lfcs/GalmicheP94">
  <author>Didier <surname>Galmiche</surname></author>
  <author>Guy <surname>Perrier</surname></author>
  <year>1994</year>
  <title>Foundations of Proof Search Strategies Design in Linear Logic</title>
  <editor>Anil <surname>Nerode</surname></editor>
  <editor>Yuri V. <surname>Matiyasevich</surname></editor>
  <booktitle>Proc. of LFCS'94</booktitle>
  <series>LNCS</series>
  <volume>813</volume>
  <publisher>Springer</publisher>
  <pages>101&#8211;113</pages>
  <doi>10.1007/3-540-58140-5_11</doi>
 </citation>
 <citation type="article" key="girard87tcs">
  <author>Jean-Yves <surname>Girard</surname></author>
  <year>1987</year>
  <title>Linear Logic</title>
  <journal>Theoretical Computer Science</journal>
  <volume>50</volume>
  <pages>1&#8211;102</pages>
  <doi>10.1016/0304-3975(87)90045-4</doi>
 </citation>
 <citation type="book" key="klccne1952im">
  <author>S. <surname>Kleene</surname></author>
  <year>1952</year>
  <title>Introduction to Metamathematics</title>
  <publisher>Van Nostrand, New York</publisher>
 </citation>
 <citation type="inproceedings" key="Laurent18">
  <author>Olivier <surname>Laurent</surname></author>
  <year>2018</year>
  <title>Around Classical and Intuitionistic Linear Logics</title>
  <editor>Anuj <surname>Dawar</surname></editor>
  <editor>Erich <surname>Gr&#228;del</surname></editor>
  <booktitle>Proceedings of LICS</booktitle>
  <publisher>ACM</publisher>
  <pages>629&#8211;638</pages>
  <doi>10.1145/3209108.3209132</doi>
 </citation>
 <citation type="article" key="LiangM09">
  <author>Chuck <surname>Liang</surname></author>
  <author>Dale <surname>Miller</surname></author>
  <year>2009</year>
  <title>Focusing and polarization in linear, intuitionistic, and classical logics</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>410</volume>
  <number>46</number>
  <pages>4747&#8211;4768</pages>
  <doi>10.1016/j.tcs.2009.07.041</doi>
 </citation>
 <citation type="article" key="DBLP:journals/apal/LincolnMSS92">
  <author>Patrick <surname>Lincoln</surname></author>
  <author>John C. <surname>Mitchell</surname></author>
  <author>Andre <surname>Scedrov</surname></author>
  <author>Natarajan <surname>Shankar</surname></author>
  <year>1992</year>
  <title>Decision Problems for Propositional Linear Logic</title>
  <journal>Annals of Pure and Applied Logic</journal>
  <volume>56</volume>
  <number>1-3</number>
  <pages>239&#8211;311</pages>
  <doi>10.1016/0168-0072(92)90075-B</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/lpar/LopezP99">
  <author>Pablo <surname>L&#243;pez</surname></author>
  <author>Ernesto <surname>Pimentel</surname></author>
  <year>1999</year>
  <title>Resource Management in Linear Logic Search Revisited</title>
  <editor>Harald <surname>Ganzinger</surname></editor>
  <editor>David A. <surname>McAllester</surname></editor>
  <editor>Andrei <surname>Voronkov</surname></editor>
  <booktitle>LPAR'99</booktitle>
  <series>LNCS</series>
  <volume>1705</volume>
  <publisher>Springer</publisher>
  <pages>304&#8211;319</pages>
  <doi>10.1007/3-540-48242-3_19</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/ctcs/Marti-OlietM89">
  <author>Narciso <surname>Mart&#237;-Oliet</surname></author>
  <author>Jos&#233; <surname>Meseguer</surname></author>
  <year>1989</year>
  <title>From Petri Nets to Linear Logic</title>
  <editor>David H. <surname>Pitt</surname></editor>
  <editor>David E. <surname>Rydeheard</surname></editor>
  <editor>Peter <surname>Dybjer</surname></editor>
  <editor>Andrew M. <surname>Pitts</surname></editor>
  <editor>Axel <surname>Poign&#233;</surname></editor>
  <booktitle>Category Theory and Computer Science</booktitle>
  <series>LNCS</series>
  <volume>389</volume>
  <publisher>Springer</publisher>
  <pages>313&#8211;340</pages>
  <doi>10.1007/BFb0018359</doi>
 </citation>
 <citation type="article" key="DBLP:journals/jlp/Meseguer12">
  <author>Jos&#233; <surname>Meseguer</surname></author>
  <year>2012</year>
  <title>Twenty years of rewriting logic</title>
  <journal>J. Log. Algebr. Program.</journal>
  <volume>81</volume>
  <number>7-8</number>
  <pages>721&#8211;781</pages>
  <doi>10.1016/j.jlap.2012.06.003</doi>
 </citation>
 <citation type="article" key="MillerP13">
  <author>Dale <surname>Miller</surname></author>
  <author>Elaine <surname>Pimentel</surname></author>
  <year>2013</year>
  <title>A formal framework for specifying sequent calculus proof systems</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>474</volume>
  <pages>98&#8211;116</pages>
  <doi>10.1016/j.tcs.2012.12.008</doi>
 </citation>
 <citation type="article" key="DBLP:journals/jolli/Mints93">
  <author>Grigori <surname>Mints</surname></author>
  <year>1993</year>
  <title>Resolution calculus for the first order linear logic</title>
  <journal>Journal of Logic, Language and Information</journal>
  <volume>2</volume>
  <number>1</number>
  <pages>59&#8211;83</pages>
  <doi>10.1007/BF01051768</doi>
 </citation>
 <citation type="article" key="Nigam2010">
  <author>Vivek <surname>Nigam</surname></author>
  <author>Dale <surname>Miller</surname></author>
  <year>2010</year>
  <title>A Framework for Proof Systems</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>45</volume>
  <number>2</number>
  <pages>157&#8211;188</pages>
  <doi>10.1007/s10817-010-9182-1</doi>
 </citation>
 <citation type="article" key="OlarteP17">
  <author>Carlos <surname>Olarte</surname></author>
  <author>Elaine <surname>Pimentel</surname></author>
  <year>2017</year>
  <title>On concurrent behaviors and focusing in linear logic</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>685</volume>
  <pages>46&#8211;64</pages>
  <doi>10.1016/j.tcs.2016.08.026</doi>
 </citation>
 <citation type="inproceedings" key="qmltp2">
  <author>Thomas <surname>Raths</surname></author>
  <author>Jens <surname>Otten</surname></author>
  <year>2012</year>
  <title>The QMLTP problem library for first-order modal logics</title>
  <booktitle>International Joint Conference on Automated Reasoning</booktitle>
  <pages>454&#8211;461</pages>
  <doi>10.1007/978-3-642-31365-3_35</doi>
 </citation>
 <citation type="article" key="iltp">
  <author>Thomas <surname>Raths</surname></author>
  <author>Jens <surname>Otten</surname></author>
  <author>Christoph <surname>Kreitz</surname></author>
  <year>2007</year>
  <title>The ILTP problem library for intuitionistic logic</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>38</volume>
  <number>1-3</number>
  <pages>261&#8211;271</pages>
  <doi>10.1007/s10817-006-9060-z</doi>
 </citation>
 <citation type="book" key="DBLP:books/sp/Reisig85a">
  <author>Wolfgang <surname>Reisig</surname></author>
  <year>1985</year>
  <title>Petri Nets: An Introduction</title>
  <series>EATCS Monographs on Theoretical Computer Science</series>
  <volume>4</volume>
  <publisher>Springer</publisher>
  <doi>10.1007/978-3-642-69968-9</doi>
 </citation>
 <citation type="article" key="Schellinx91">
  <author>Harold <surname>Schellinx</surname></author>
  <year>1991</year>
  <title>Some Syntactical Observations on Linear Logic</title>
  <journal>J. Log. Comput.</journal>
  <volume>1</volume>
  <number>4</number>
  <pages>537&#8211;559</pages>
  <doi>10.1093/logcom/1.4.537</doi>
 </citation>
 <citation type="article" key="Sut17">
  <author>G. <surname>Sutcliffe</surname></author>
  <year>2017</year>
  <title>The TPTP Problem Library and Associated Infrastructure. From CNF to TH0, TPTP v6.4.0</title>
  <journal>Journal of Automated Reasoning</journal>
  <volume>59</volume>
  <number>4</number>
  <pages>483&#8211;502</pages>
  <doi>10.1007/s10817-017-9407-7</doi>
 </citation>
 <citation type="article" key="DBLP:journals/jar/Tammet94">
  <author>Tanel <surname>Tammet</surname></author>
  <year>1994</year>
  <title>Proof Sytrategies in Linear Logic</title>
  <journal>J. Autom. Reasoning</journal>
  <volume>12</volume>
  <number>3</number>
  <pages>273&#8211;304</pages>
  <doi>10.1007/BF00885763</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/kgc/Tammet97">
  <author>Tanel <surname>Tammet</surname></author>
  <year>1997</year>
  <title>Resolution, Inverse Method and the Sequent Calculus</title>
  <editor>Georg <surname>Gottlob</surname></editor>
  <editor>Alexander <surname>Leitsch</surname></editor>
  <editor>Daniele <surname>Mundici</surname></editor>
  <booktitle>KGC'97</booktitle>
  <series>LNCS</series>
  <volume>1289</volume>
  <publisher>Springer</publisher>
  <pages>65&#8211;83</pages>
  <doi>10.1007/3-540-63385-5_33</doi>
 </citation>
 <citation type="book" key="troelstra92csli">
  <author>Anne S. <surname>Troelstra</surname></author>
  <year>1992</year>
  <title>Lectures on Linear Logic</title>
  <publisher>CSLI Lecture Notes 29, Center for the Study of Language and Information</publisher>
  <address>Stanford, California</address>
 </citation>
 <citation type="inproceedings" key="qmltp1">
  <author>Max <surname>Wisniewski</surname></author>
  <author>Alexander <surname>Steen</surname></author>
  <author>Christoph <surname>Benzm&#252;ller</surname></author>
  <year>2016</year>
  <title>TPTP and Beyond: Representation of Quantified Non-Classical Logics</title>
  <editor>Christoph <surname>Benzm&#252;ller</surname></editor>
  <editor>Jens <surname>Otten</surname></editor>
  <booktitle>Proceedings of ARQNL@IJCAR</booktitle>
  <series>CEUR Workshop Proceedings</series>
  <volume>1770</volume>
  <publisher>CEUR-WS.org</publisher>
  <pages>51&#8211;65</pages>
 </citation>
</bibliography>
