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