Selected Papers of Roberto Maieli
-
A Proof of the Focusing Theorem via MALL Proof Nets
Proceedings of "Logic, Language, Information, and Computation"
28th International Workshop, WoLLIC 2022, Iasi, Romania, September 20-23, 2022 (
PDF
)
-
Probabilistic logic programming with multiplicative
modules
Proceedings of "5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021)"
Online (Rome virtually)
27-28 June 2021
-
Generalized Connectives for Multiplicative Linear Logic
with Matteo Acclavio.
In LIPIcs, Vol. 152, Proceedings of the 28th EACSL Annual Conference on Computer Science Logic (CSL 2020).
-
Non decomposable connectives of linear logic
In Annals of Pure and Applied Logic, Volume 170, Issue 11, November 2019.
(doi:10.1016/j.apal.2019.05.006).
-
Proof Nets for Multiplicative Cyclic Linear
Logic and Lambek Calculus
with V. Michele Abrusci.
in Mathematical Structures in Computer Science, Volume 29, Issue 6, June 2019, pp.733-762
(doi:10.1017/S0960129518000300).
-
Cyclic Multiplicative and Additive Proof Nets of Linear Logic
with an Application to Language Parsing
with V. Michele Abrusci.
In A. Foret, G. Morrill, R. Muskens, R. Osswald and S. Pogodalla (eds.)
Formal Grammar 2015 and 2016: Proceedings. Springer Lecture Notes in Computer Science,
FoLLI Publications on Logic, Language and Information, LNCS 9804, pp. 43-59 Springer, Heidelberg.
-
Cyclic Multiplicative Proof Nets of Linear Logic
with an Application to Language Parsing
with V. Michele Abrusci.
In: Proc. of The 22nd Workshop on Logic, Language,
Information and Computation (WoLLIC 2015), July 20-23, 2015, Indiana University, Bloomington, USA.
Springer-Verlag Berlin Heidelberg 2015. V. de Paiva et al. (Eds.): WoLLIC 2015,
LNCS 9160, pp. 53-68, 2015.
-
Construction of retractile proof structures.
(conference version) - (extended version)
In: Proc. of
RTA-TLCA 2014 Conference,
July 14-17, 2014, Vienna, Austria.
LNCS 8560, pp. 319-333, 2014. Springer International Publishing Switzerland 2014.
-
Bipolar Proof Nets for MALL
In: Proceedings of the
PCC 2012 - Proof, Computation, Complexity.
17-18 August 2012, University of Copenhagen, Denmark.
-
Cut Elimination for Monomial MALL Proof Nets.
with Olivier Laurent.
Twenty-Third Annual IEEE Symposium on Logic in Computer Science
(LICS 2008),
24 - 27 June 2008, Pittsburgh, Pennsylvania, USA
-
Cut Elimination for Monomial Proof Nets of the Purely Multiplicative
and Additive Fragment of Linear Logic.
Istituto di Applicazione del Calcolo, Consiglio Nazionale delle Ricerche, N.140 (2/2008). (HAL Id: hal-01153910)
-
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic.
14th International Conference on Logic for Programming
Artificial Intelligence and Reasoning (LPAR'07).
Springer-Verlag LNAI 4790, pp. 363-377, 2007.
-
Interactive Correctness Criterion for Multiplicative and Additive Proof Nets.
with Paul Ruet.
Twenty-First Annual IEEE Symp., LICS 2006, August 12th-15th, 2006, Seattle, Washington, USA.
-
Non-commutative Proof Construction: A constraint-based approach.
with Jean-Marc Andreoli
and Paul Ruet.
Annals of Pure and Applied Logic 142(1-3): 212-244, 2006.
-
Modularity of proof nets: generating the type of a module.
with Quintijn Puite.
Archive for Mathematical Logic, Volume 44, Number 2, 2005, pg. 167-193
-
A new correctness criterion for multiplicative non commutative proof-nets.
Archive for Mathematical Logic, vol.42, 205-220, Springer-Verlag, 2003
-
Non-commutative logic III : focusing proofs.
with Paul Ruet.
Information and Computation 185(2): 233-262, 2003.
-
Focusing and proof-nets in linear and non-commutative logic.
with Jean-Marc Andreoli.
In Proc. of the LPAR 1999 Conference. Spinger LNAI, 1705, 1999
-
Focalizzazione delle prove in logica non-commutativa
Tesi di Dottorato, Universita' degli Studi di Roma "La Sapienza",
28 Aprile, 2000.
Some Recent Conferences and Workshops
Back to my
Home Page
|