Generalized Connectives for Multiplicative Linear Logic.
M. Acclavio and R. Maieli.
In 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, LIPIcs 152, pp. 6:1–6:16, 2020.
[ bib | preprint | DOI ]
Logic Beyond Formulas: A Proof System on Graphs.
M. Acclavio, R. Horne and L. Straßburger.
In LICS ’20: 35th Annual ACM⁄IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020.
ACM, pp. 38–52, 2020.
[ bib | preprint | DOI ]
2019:
Proof Diagrams for Multiplicative Linear Logic: Syntax and Semantics.
M. Acclavio.
J. Autom. Reason.,
63(4):911–939, 2019.
[ bib | preprint | DOI ]
On Combinatorial Proofs for Modal Logic.
M. Acclavio and L. Straßburger.
In Automated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings.
Springer, Lecture Notes in Computer Science 11714, pp. 223–240, 2019.
[ bib | preprint | DOI ]
On Combinatorial Proofs for Logics of Relevance and Entailment.
M. Acclavio and L. Straßburger.
In Logic, Language, Information, and Computation - 26th International Workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2-5, 2019, Proceedings.
Springer, Lecture Notes in Computer Science 11541, pp. 1–16, 2019.
[ bib | preprint | DOI ]
2018:
From Syntactic Proofs to Combinatorial Proofs.
M. Acclavio and L. Straßburger.
In Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings.
Springer, Lecture Notes in Computer Science 10900, pp. 481–497, 2018.
[ bib | preprint | DOI ]
2017:
Proof Diagrams for Multiplicative Linear Logic: Syntax and Semantics.
M. Acclavio.
CoRR,
abs/1702.00268, 2017.
[ bib | preprint ]
2016:
Proof diagrams for multiplicative linear logic.
M. Acclavio.
In Proceedings Fourth International Workshop on Linearity, LINEARITY 2016, Porto, Portugal, 25 June 2016.
EPTCS 238, pp. 11–23, 2016.
[ bib | preprint | DOI ]