Follow
Camillo Fiorentini
Camillo Fiorentini
Verified email at di.unimi.it - Homepage
Title
Cited by
Cited by
Year
fCube: An Efficient Prover for Intuitionistic Propositional Logic
M Ferrari, C Fiorentini, G Fiorino
Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010
392010
Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models
M Ferrari, C Fiorentini, G Fiorino
Journal of automated reasoning 51, 129-149, 2013
382013
A constructive approach to testing model transformations
C Fiorentini, A Momigliano, M Ornaghi, I Poernomo
Theory and Practice of Model Transformations: Third International Conference …, 2010
352010
Combining word problems through rewriting in categories with products
C Fiorentini, S Ghilardi
Theoretical Computer Science 294 (1-2), 103-149, 2003
262003
A constructive semantics for ALC
L Bozzato, M Ferrari, C Fiorentini, G Fiorino
Proceedings of the 20th International workshop on description logics, DL'07 …, 2007
232007
Simplification rules for intuitionistic propositional tableaux
M Ferrari, C Fiorentini, G Fiorino
ACM Transactions on Computational Logic (TOCL) 13 (2), 1-23, 2012
222012
Proof-search in natural deduction calculus for classical propositional logic
M Ferrari, C Fiorentini
Automated Reasoning with Analytic Tableaux and Related Methods: 24th …, 2015
172015
: Basic Constructive Description Logic
M Ferrari, C Fiorentini, G Fiorino
Journal of Automated Reasoning 44 (4), 371-399, 2010
172010
An evaluation-driven decision procedure for G3i
M Ferrari, C Fiorentini, G Fiorino
ACM Transactions on Computational Logic (TOCL) 16 (1), 1-37, 2015
162015
On the complexity of the disjunction property in intuitionistic and modal logics
M Ferrari, C Fiorentini, G Fiorino
ACM Transactions on Computational Logic (TOCL) 6 (3), 519-538, 2005
142005
A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic
C Fiorentini, R Goré, S Graham-Lengrand
Automated Reasoning with Analytic Tableaux and Related Methods: 28th …, 2019
132019
A forward unprovability calculus for intuitionistic propositional logic
C Fiorentini, M Ferrari
Automated Reasoning with Analytic Tableaux and Related Methods: 26th …, 2017
132017
A constructive object oriented modeling language for information systems
M Ornaghi, M Benini, M Ferrari, C Fiorentini, A Momigliano
Electronic Notes in Theoretical Computer Science 153 (1), 55-75, 2006
132006
Terminating sequent calculi for proving and refuting formulas in S4
C Fiorentini
Journal of Logic and Computation 25 (1), 179-205, 2015
112015
A decidable constructive description logic
L Bozzato, M Ferrari, C Fiorentini, G Fiorino
European Workshop on Logics in Artificial Intelligence, 51-63, 2010
112010
Kripke completeness for intermediate logics
C Fiorentini
Università degli Studi di Milano, 2000
112000
JTabWb: a Java framework for implementing terminating sequent and tableau calculi
M Ferrari, C Fiorentini, G Fiorino
Fundamenta Informaticae 150 (1), 119-142, 2017
102017
Snapshot generation in a constructive object-oriented modeling language
M Ferrari, C Fiorentini, A Momigliano, M Ornaghi
Logic-Based Program Synthesis and Transformation: 17th International …, 2008
102008
Duality between unprovability and provability in forward refutation-search for intuitionistic propositional logic
C Fiorentini, M Ferrari
ACM Transactions on Computational Logic (TOCL) 21 (3), 1-47, 2020
92020
Goal oriented information extraction in uniformly constructive calculi
M Ferrari, C Fiorentini, P Miglioli
Proceedings of WAIT’99: Workshop Argentino de Informática Teórica, 51-63, 1999
91999
The system can't perform the operation now. Try again later.
Articles 1–20