| 2025 | TABLEAUX | A Gdel Modal Logic over Witnessed Crisp Models. | Mauro Ferrari, Camillo Fiorentini, Ricardo Oscar Rodrguez |
| 2024 | IJCAR | A Terminating Sequent Calculus for Intuitionistic Strong Lb Logic with the Subformula Property. | Camillo Fiorentini, Mauro Ferrari |
| 2022 | CADE | SAT-Based Proof Search in Intermediate Propositional Logics. | Camillo Fiorentini, Mauro Ferrari |
| 2021 | CADE | Efficient SAT-based Proof Search in Intuitionistic Propositional Logic. | Camillo Fiorentini |
| 2019 | IJCAI | An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic. | Camillo Fiorentini |
| 2019 | TABLEAUX | A Proof-Theoretic Perspective on SMT-Solving for Intuitionistic Propositional Logic. | Camillo Fiorentini, Rajeev Gor, Stphane Graham-Lengrand |
| 2017 | TABLEAUX | A Forward Unprovability Calculus for Intuitionistic Propositional Logic. | Camillo Fiorentini, Mauro Ferrari |
| 2015 | TABLEAUX | Proof-Search in Natural Deduction Calculus for Classical Propositional Logic. | Mauro Ferrari, Camillo Fiorentini |
| 2013 | TABLEAUX | A Terminating Evaluation-Driven Variant of G3i. | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino |
| 2010 | JELIA | A Decidable Constructive Description Logic. | Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino |
| 2010 | LPAR | fCube: An Efficient Prover for Intuitionistic Propositional Logic. | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino |
| 2009 | LPNMR | Applying ASP to UML Model Validation. | Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano, Francesco Pagano |
| 2007 | LOPSTR | Snapshot Generation in a Constructive Object-Oriented Modeling Language. | Mauro Ferrari, Camillo Fiorentini, Alberto Momigliano, Mario Ornaghi |
| 2004 | CSL | A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation. | Alessandro Avellone, Camillo Fiorentini, Guido Fiorino, Ugo Moscato |
| 2002 | LPAR | On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics. | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino |
| 2002 | TABLEAUX | Tableau Calculi for the Logics of Finite k-Ary Trees. | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino |
| 2001 | LOPSTR | Extracting Exact Time Bounds from Logical Proofs. | Mauro Ferrari, Camillo Fiorentini, Mario Ornaghi |
| 2000 | LOPSTR | A formal framework for synthesis and verification of logic programs. | Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini |
| 2000 | LOPSTR | A Formal Framework for Synthesis and Verification of Logic Programs. | Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini |