On maximal intermediate predicate constructive logics. - Alessandro Avellone; Camillo Fiorentini; Paolo Mantovani; Pierangelo Miglioli (Stud Logica, 1996)

A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications. - Camillo Fiorentini; Pierangelo Miglioli (Log. J. IGPL, 1999)

A Formal Framework for Synthesis and Verification of Logic Programs. - Alessandro Avellone; Mauro Ferrari 002; Camillo Fiorentini (LOPSTR (LNCS 2042: Selected Papers), 2000)

All Intermediate Logics with Extra Axions in One Variable, Except Eight, Are Not Strongly omega-Complete. - Camillo Fiorentini (J. Symb. Log., 2000)

Extracting Exact Time Bounds from Logical Proofs. - Mauro Ferrari 002; Camillo Fiorentini; Mario Ornaghi (LOPSTR, 2001)

Extracting information from intermediate semiconstructive HA-systems - extended abstract. - Mauro Ferrari 002; Camillo Fiorentini; Pierangelo Miglioli (Math. Struct. Comput. Sci., 2001)

Hypercanonicity, Extensive Canonicity, Canonicity and Strong Completeness of Intermediate Propositional Logics. - Camillo Fiorentini (Reports Math. Log., 2001)

On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (LPAR, 2002)

Tableau Calculi for the Logics of Finite k-Ary Trees. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (TABLEAUX, 2002)

A Proof-theoretical Analysis of Semiconstructive Intermediate Theories. - Mauro Ferrari 002; Camillo Fiorentini (Stud Logica, 2003)

Combining word problems through rewriting in categories with products. - Camillo Fiorentini; Silvio Ghilardi (Theor. Comput. Sci., 2003)

A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation. - Alessandro Avellone; Camillo Fiorentini; Guido Fiorino; Ugo Moscato (CSL, 2004)

A secondary semantics for Second Order Intuitionistic Propositional Logic. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (Math. Log. Q., 2004)

ESBC: an application for computing stabilization bounds. - Alessandro Avellone; Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino; Ugo Moscato (CLASE, 2005)

A Constructive Object Oriented Modeling Language for Information Systems. - Mario Ornaghi; Marco Benini; Mauro Ferrari 002; Camillo Fiorentini; Alberto Momigliano (CLASE, 2005)

On the complexity of the disjunction property in intuitionistic and modal logics. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (ACM Trans. Comput. Log., 2005)

A Constructive Semantics for ALC. - Loris Bozzato; Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (Description Logics, 2007)

Snapshot Generation in a Constructive Object-Oriented Modeling Language. - Mauro Ferrari 002; Camillo Fiorentini; Alberto Momigliano; Mario Ornaghi (LOPSTR, 2007)

Towards a Type Discipline for Answer Set Programming. - Camillo Fiorentini; Alberto Momigliano; Mario Ornaghi (TYPES, 2008)

Applying ASP to UML Model Validation. - Mario Ornaghi; Camillo Fiorentini; Alberto Momigliano; Francesco Pagano (LPNMR, 2009)

A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (J. Appl. Non Class. Logics, 2009)

A Constructive Approach to Testing Model Transformations. - Camillo Fiorentini; Alberto Momigliano; Mario Ornaghi; Iman Poernomo (ICMT@TOOLS, 2010)

A Decidable Constructive Description Logic. - Loris Bozzato; Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (JELIA, 2010)

fCube: An Efficient Prover for Intuitionistic Propositional Logic. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (LPAR (Yogyakarta), 2010)

BCDL boldsymbol { cal BC !D !L}: Basic Constructive Description Logic. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (J. Autom. Reason., 2010)

Simplification Rules for Intuitionistic Propositional Tableaux. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (ACM Trans. Comput. Log., 2012)

Focusing on Contraction. - Alessandro Avellone; Camillo Fiorentini; Alberto Momigliano (CILC, 2013)

A Terminating Evaluation-Driven Variant of G3i. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (TABLEAUX, 2013)

Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (J. Autom. Reason., 2013)

Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (CILC, 2015)

Proof-Search in Natural Deduction Calculus for Classical Propositional Logic. - Mauro Ferrari 002; Camillo Fiorentini (TABLEAUX, 2015)

A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic. - Alessandro Avellone; Camillo Fiorentini; Alberto Momigliano (Fundam. Informaticae, 2015)

Terminating sequent calculi for proving and refuting formulas in S4. - Camillo Fiorentini (J. Log. Comput., 2015)

An Evaluation-Driven Decision Procedure for G3i. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (ACM Trans. Comput. Log., 2015)

Proof-Search in Hilbert Calculi. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (ICTCS/CILC, 2017)

LOGI: A Didactic Tool for a Beginners' Course in Logic (System Description). - Mario Ornaghi; Camillo Fiorentini; Alberto Momigliano (ICTCS/CILC, 2017)

A Forward Unprovability Calculus for Intuitionistic Propositional Logic. - Camillo Fiorentini; Mauro Ferrari 002 (TABLEAUX, 2017)

JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (Fundam. Informaticae, 2017)

Forward Countermodel Construction in Modal Logic K. - Mauro Ferrari 002; Camillo Fiorentini; Guido Fiorino (CILC, 2018)

Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic. - Camillo Fiorentini; Mauro Ferrari 002 (CoRR, 2018)

From Constructivism to Logic Programming: an Homage to Mario Ornaghi. - Mauro Ferrari 002; Camillo Fiorentini; Alberto Momigliano (Fundam. Informaticae, 2018)

Preface. - Camillo Fiorentini; Alberto Momigliano; Alberto Pettorossi (Fundam. Informaticae, 2018)

An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic. - Camillo Fiorentini (IJCAI, 2019)

A Proof-Theoretic Perspective on SMT-Solving for Intuitionistic Propositional Logic. - Camillo Fiorentini; Rajeev Goré; Stéphane Graham-Lengrand (TABLEAUX, 2019)

Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic. - Mauro Ferrari 002; Camillo Fiorentini (J. Autom. Reason., 2019)

Reasoning on Information Term Semantics with ASP for Constructive ELꓕ. - Loris Bozzato; Camillo Fiorentini (CILC, 2020)

A Natural Deduction Calculus for Gödel-Dummett Logic Internalizing Proof-search Control Mechanisms. - Camillo Fiorentini; Mauro Ferrari 002 (CILC, 2020)

Connections Between Answer Set Semantics and Information Terms Semantics in Constructive EL_bot (Extended Abstract). - Loris Bozzato; Camillo Fiorentini (Description Logics, 2020)

Forward proof-search and Countermodel Construction in Intuitionistic Propositional Logic. - Camillo Fiorentini; Mauro Ferrari 002 (ICTCS, 2020)

Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic. - Camillo Fiorentini; Mauro Ferrari 002 (ACM Trans. Comput. Log., 2020)

Efficient SAT-based Proof Search in Intuitionistic Propositional Logic. - Camillo Fiorentini (CADE, 2021)

A forward internal calculus for model generation in S4. - Camillo Fiorentini; Mauro Ferrari 002 (J. Log. Comput., 2021)

SAT-Based Proof Search in Intermediate Propositional Logics. - Camillo Fiorentini; Mauro Ferrari 002 (IJCAR, 2022)

Forward refutation for Gödel-Dummett Logics. - Camillo Fiorentini; Mauro Ferrari 002 (CILC, 2022)

A New Approach to Clausification for Intuitionistic Propositional Logic. - Camillo Fiorentini; Mauro Ferrari 002 (CILC, 2023)

A Terminating Sequent Calculus for Intuitionistic Strong Löb Logic with the Subformula Property. - Camillo Fiorentini; Mauro Ferrari 002 (IJCAR (2), 2024)

General Clauses for SAT-Based Proof Search in Intuitionistic Propositional Logic. - Camillo Fiorentini; Mauro Ferrari 002 (J. Autom. Reason., 2024)

Proof Search and Countermodel Construction for iCK4. - Mauro Ferrari 002; Camillo Fiorentini; Paolo Giardini (CILC, 2025)