| 2007 |
|---|
| 19 | EE | Loris Bozzato,
Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
A Constructive Semantics for ALC.
Description Logics 2007 |
| 18 | EE | Mauro Ferrari,
Camillo Fiorentini,
Alberto Momigliano,
Mario Ornaghi:
Snapshot Generation in a Constructive Object-Oriented Modeling Language.
LOPSTR 2007: 169-184 |
| 2006 |
|---|
| 17 | EE | Alessandro Avellone,
Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino,
Ugo Moscato:
ESBC: an application for computing stabilization bounds.
Electr. Notes Theor. Comput. Sci. 153(1): 23-33 (2006) |
| 16 | EE | Mario Ornaghi,
Marco Benini,
Mauro Ferrari,
Camillo Fiorentini,
Alberto Momigliano:
A Constructive Object Oriented Modeling Language for Information Systems.
Electr. Notes Theor. Comput. Sci. 153(1): 55-75 (2006) |
| 2005 |
|---|
| 15 | EE | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
On the complexity of the disjunction property in intuitionistic and modal logics.
ACM Trans. Comput. Log. 6(3): 519-538 (2005) |
| 2004 |
|---|
| 14 | EE | 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: 488-502 |
| 13 | EE | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
A secondary semantics for Second Order Intuitionistic Propositional Logic.
Math. Log. Q. 50(2): 202-210 (2004) |
| 2003 |
|---|
| 12 | | Mauro Ferrari,
Camillo Fiorentini:
A Proof-theoretical Analysis of Semiconstructive Intermediate Theories.
Studia Logica 73(1): 21-49 (2003) |
| 11 | | Camillo Fiorentini,
Silvio Ghilardi:
Combining word problems through rewriting in categories with products.
Theor. Comput. Sci. 294(1/2): 103-149 (2003) |
| 2002 |
|---|
| 10 | EE | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics.
LPAR 2002: 175-189 |
| 9 | EE | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
Tableau Calculi for the Logics of Finite k-Ary Trees.
TABLEAUX 2002: 115-129 |
| 2001 |
|---|
| 8 | EE | Mauro Ferrari,
Camillo Fiorentini,
Mario Ornaghi:
Extracting Exact Time Bounds from Logical Proofs.
LOPSTR 2001: 245-266 |
| 7 | | Mauro Ferrari,
Camillo Fiorentini,
Pierangelo Miglioli:
Extracting information from intermediate semiconstructive HA-systems - extended abstract.
Mathematical Structures in Computer Science 11(4): 589-596 (2001) |
| 6 | EE | Camillo Fiorentini:
Hypercanonicity, Extensive Canonicity, Canonicity and Strong Completeness of Intermediate Propositional Logics.
Reports on Mathematical Logic 35: 3-46 (2001) |
| 2000 |
|---|
| 5 | EE | Alessandro Avellone,
Mauro Ferrari,
Camillo Fiorentini:
A formal framework for synthesis and verification of logic programs.
LOPSTR 2000 |
| 4 | EE | Alessandro Avellone,
Mauro Ferrari,
Camillo Fiorentini:
A Formal Framework for Synthesis and Verification of Logic Programs.
LOPSTR (LNCS 2042: Selected Papers) 2000: 1-17 |
| 3 | | Camillo Fiorentini:
All Intermediate Logics with Extra Axions in One Variable, Except Eight, Are Not Strongly omega-Complete.
J. Symb. Log. 65(4): 1576-1604 (2000) |
| 1999 |
|---|
| 2 | EE | Camillo Fiorentini,
Pierangelo Miglioli:
A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications.
Logic Journal of the IGPL 7(6): 733-753 (1999) |
| 1996 |
|---|
| 1 | | Alessandro Avellone,
Camillo Fiorentini,
Paolo Mantovani,
Pierangelo Miglioli:
On maximal intermediate predicate constructive logics.
Studia Logica 57(2/3): 373-408 (1996) |
