Camillo Fiorentini

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 28

Top Topics

Sequent Calculus

Propositional Logic

Extended Abstract

Top Venues

Fundam. Informaticae

J. Autom. Reason.

Publications

Camillo Fiorentini, Mauro Ferrari
General Clauses for SAT-Based Proof Search in Intuitionistic Propositional Logic. J. Autom. Reason. 68 (3) (2024)
Camillo Fiorentini, Mauro Ferrari
A Terminating Sequent Calculus for Intuitionistic Strong Löb Logic with the Subformula Property. IJCAR (2) (2024)
Camillo Fiorentini, Mauro Ferrari
A New Approach to Clausification for Intuitionistic Propositional Logic. CILC (2023)
Camillo Fiorentini, Mauro Ferrari
Forward refutation for Gödel-Dummett Logics. CILC (2022)
Camillo Fiorentini, Mauro Ferrari
SAT-Based Proof Search in Intermediate Propositional Logics. IJCAR (2022)
Camillo Fiorentini
Efficient SAT-based Proof Search in Intuitionistic Propositional Logic. CADE (2021)
Camillo Fiorentini, Mauro Ferrari
A forward internal calculus for model generation in S4. J. Log. Comput. 31 (3) (2021)
Loris Bozzato, Camillo Fiorentini
Reasoning on Information Term Semantics with ASP for Constructive ELꓕ. CILC (2020)
Camillo Fiorentini, Mauro Ferrari
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic. ACM Trans. Comput. Log. 21 (3) (2020)
Loris Bozzato, Camillo Fiorentini
Connections Between Answer Set Semantics and Information Terms Semantics in Constructive EL_bot (Extended Abstract). Description Logics (2020)
Camillo Fiorentini, Mauro Ferrari
Forward proof-search and Countermodel Construction in Intuitionistic Propositional Logic. ICTCS (2020)
Camillo Fiorentini, Mauro Ferrari
A Natural Deduction Calculus for Gödel-Dummett Logic Internalizing Proof-search Control Mechanisms. CILC (2020)
Camillo Fiorentini
An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic. IJCAI (2019)
Mauro Ferrari, Camillo Fiorentini
Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic. J. Autom. Reason. 62 (1) (2019)
Camillo Fiorentini, Rajeev Goré, Stéphane Graham-Lengrand
A Proof-Theoretic Perspective on SMT-Solving for Intuitionistic Propositional Logic. TABLEAUX (2019)
Camillo Fiorentini, Alberto Momigliano, Alberto Pettorossi
Preface. Fundam. Informaticae 161 (1-2) (2018)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
Forward Countermodel Construction in Modal Logic K. CILC (2018)
Mauro Ferrari, Camillo Fiorentini, Alberto Momigliano
From Constructivism to Logic Programming: an Homage to Mario Ornaghi. Fundam. Informaticae 161 (1-2) (2018)
Camillo Fiorentini, Mauro Ferrari
Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic. CoRR (2018)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. Fundam. Informaticae 150 (1) (2017)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
Proof-Search in Hilbert Calculi. ICTCS/CILC (2017)
Camillo Fiorentini, Mauro Ferrari
A Forward Unprovability Calculus for Intuitionistic Propositional Logic. TABLEAUX (2017)
Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano
LOGI: A Didactic Tool for a Beginners' Course in Logic (System Description). ICTCS/CILC (2017)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations. CILC (2015)
Camillo Fiorentini
Terminating sequent calculi for proving and refuting formulas in S4. J. Log. Comput. 25 (1) (2015)
Mauro Ferrari, Camillo Fiorentini
Proof-Search in Natural Deduction Calculus for Classical Propositional Logic. TABLEAUX (2015)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
An Evaluation-Driven Decision Procedure for G3i. ACM Trans. Comput. Log. 16 (1) (2015)
Alessandro Avellone, Camillo Fiorentini, Alberto Momigliano
A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic. Fundam. Informaticae 140 (3-4) (2015)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. CILC (2014)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models. J. Autom. Reason. 51 (2) (2013)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
A Terminating Evaluation-Driven Variant of G3i. TABLEAUX (2013)
Alessandro Avellone, Camillo Fiorentini, Alberto Momigliano
Focusing on Contraction. CILC (2013)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
Simplification Rules for Intuitionistic Propositional Tableaux. ACM Trans. Comput. Log. 13 (2) (2012)
Camillo Fiorentini, Alberto Momigliano, Mario Ornaghi, Iman Poernomo
A Constructive Approach to Testing Model Transformations. ICMT@TOOLS (2010)
Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
A Decidable Constructive Description Logic. JELIA (2010)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
fCube: An Efficient Prover for Intuitionistic Propositional Logic. LPAR (Yogyakarta) (2010)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
\boldsymbol {\cal BC\!D\!L}: Basic Constructive Description Logic. J. Autom. Reason. 44 (4) (2010)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications. J. Appl. Non Class. Logics 19 (2) (2009)
Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano, Francesco Pagano
Applying ASP to UML Model Validation. LPNMR (2009)
Camillo Fiorentini, Alberto Momigliano, Mario Ornaghi
Towards a Type Discipline for Answer Set Programming. TYPES (2008)
Mauro Ferrari, Camillo Fiorentini, Alberto Momigliano, Mario Ornaghi
Snapshot Generation in a Constructive Object-Oriented Modeling Language. LOPSTR (2007)
Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
A Constructive Semantics for ALC. Description Logics (2007)
Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, Ugo Moscato
ESBC: an application for computing stabilization bounds. Electron. Notes Theor. Comput. Sci. 153 (1) (2006)
Mario Ornaghi, Marco Benini, Mauro Ferrari, Camillo Fiorentini, Alberto Momigliano
A Constructive Object Oriented Modeling Language for Information Systems. Electron. Notes Theor. Comput. Sci. 153 (1) (2006)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
On the complexity of the disjunction property in intuitionistic and modal logics. ACM Trans. Comput. Log. 6 (3) (2005)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
A secondary semantics for Second Order Intuitionistic Propositional Logic. Math. Log. Q. 50 (2) (2004)
Alessandro Avellone, Camillo Fiorentini, Guido Fiorino, Ugo Moscato
A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation. CSL (2004)
Camillo Fiorentini, Silvio Ghilardi
Combining word problems through rewriting in categories with products. Theor. Comput. Sci. 294 (1/2) (2003)
Mauro Ferrari, Camillo Fiorentini
A Proof-theoretical Analysis of Semiconstructive Intermediate Theories. Stud Logica 73 (1) (2003)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
Tableau Calculi for the Logics of Finite k-Ary Trees. TABLEAUX (2002)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics. LPAR (2002)
Mauro Ferrari, Camillo Fiorentini, Pierangelo Miglioli
Extracting information from intermediate semiconstructive HA-systems - extended abstract. Math. Struct. Comput. Sci. 11 (4) (2001)
Mauro Ferrari, Camillo Fiorentini, Mario Ornaghi
Extracting Exact Time Bounds from Logical Proofs. LOPSTR (2001)
Camillo Fiorentini
Hypercanonicity, Extensive Canonicity, Canonicity and Strong Completeness of Intermediate Propositional Logics. Reports Math. Log. 35 (2001)
Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini
A Formal Framework for Synthesis and Verification of Logic Programs. LOPSTR (LNCS 2042: Selected Papers) (2000)
Camillo Fiorentini
All Intermediate Logics with Extra Axions in One Variable, Except Eight, Are Not Strongly omega-Complete. J. Symb. Log. 65 (4) (2000)
Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini
A formal framework for synthesis and verification of logic programs. LOPSTR (2000)
Camillo Fiorentini, Pierangelo Miglioli
A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications. Log. J. IGPL 7 (6) (1999)
Alessandro Avellone, Camillo Fiorentini, Paolo Mantovani, Pierangelo Miglioli
On maximal intermediate predicate constructive logics. Stud Logica 57 (2/3) (1996)