Follow
Mauro Ferrari
Mauro Ferrari
Full Professor of Mathematical Logic, Universitą degli Studi dell'Insubria
Verified email at uninsubria.it - Homepage
Title
Cited by
Cited by
Year
Duplication-free tableau calculi together with cut-free and contraction-free sequent calculi for the interpolable propositional intermediate logics
A Avellone, M Ferrari, P Miglioli
Logic Journal of the IGPL 7 (4), 447-480, 1999
83*1999
Hypersequent calculi for some intermediate logics with bounded Kripke models
A Ciabattoni, M Ferrari
Journal of Logic and Computation 11 (2), 283-294, 2001
402001
Fcube: An efficient prover for intuitionistic propositional logic
M Ferrari, C Fiorentini, G Fiorino
Logic for Programming, Artificial Intelligence, and Reasoning, 294-301, 2010
362010
Counting the maximal intermediate constructive logics
M Ferrari, P Miglioli
The Journal of Symbolic Logic 58 (4), 1365-1401, 1993
331993
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
322013
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
A method to single out maximal propositional logics with the disjunction property I
M Ferrari, P Miglioli
Annals of Pure and Applied Logic 76 (1), 1-46, 1995
211995
Simplification Rules for Intuitionistic Propositional Tableaux
M Ferrari, C Fiorentini, G Fiorino
ACM Transactions on Computational Logic (TOCL) 13 (2), 14:1-14:23, 2012
192012
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
19*2006
Synthesis of programs in abstract data types
A Avellone, M Ferrari, P Miglioli
Logic-Based Program Synthesis and Transformation: 8th International Workshop …, 1999
191999
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
BCDL: Basic Constructive Description Logic
M Ferrari, C Fiorentini, G Fiorino
Journal of automated reasoning 44 (4), 371-399, 2010
172010
A method to single out maximal propositional logics with the disjunction property II
M Ferrari, P Miglioli
Annals of Pure and Applied Logic 76 (2), 117-168, 1995
161995
An evaluation-driven decision procedure for G3i
M Ferrari, C Fiorentini, G Fiorino
ACM Transactions on Computational Logic (TOCL) 16 (1), 1-37, 2015
152015
Building a Domain Ontology from Glossaries: A General Methodology.
L Bozzato, M Ferrari, A Trombetta
SWAP, 2008
142008
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
Hypertableau and path-hypertableau calculi for some families of intermediate logics
A Ciabattoni, M Ferrari
Automated Reasoning with Analytic Tableaux and Related Methods …, 2000
142000
Strongly constructive formal systems
M Ferrari
PhD. Thesis, Universitą degli Studi di Milano, 1997
131997
A forward unprovability calculus for intuitionistic propositional logic
C Fiorentini, M Ferrari
Automated Reasoning with Analytic Tableaux and Related Methods: 26th …, 2017
112017
A decidable constructive description logic
L Bozzato, M Ferrari, C Fiorentini, G Fiorino
European Workshop on Logics in Artificial Intelligence, 51-63, 2010
112010
The system can't perform the operation now. Try again later.
Articles 1–20