 | 2008 |
|---|
| 24 |       | Loris Bozzato,
Mauro Ferrari,
Paola Villa:
Actions over a Constructive Semantics for ALC.
Description Logics 2008 |
| 23 | | Loris Bozzato,
Mauro Ferrari,
Alberto Trombetta:
Building a Domain Ontology from Glossaries: A General Methodology.
SWAP 2008 |
| 2007 |
|---|
| 22 | | Loris Bozzato,
Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
A Constructive Semantics for ALC.
Description Logics 2007 |
| 21 | | Mauro Ferrari,
Camillo Fiorentini,
Alberto Momigliano,
Mario Ornaghi:
Snapshot Generation in a Constructive Object-Oriented Modeling Language.
LOPSTR 2007: 169-184 |
| 2006 |
|---|
| 20 | | 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) |
| 19 | | 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 |
|---|
| 18 | | 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 |
|---|
| 17 | | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
A secondary semantics for Second Order Intuitionistic Propositional Logic.
Math. Log. Q. 50(2): 202-210 (2004) |
| 2003 |
|---|
| 16 | | Mauro Ferrari,
Pierangelo Miglioli,
Mario Ornaghi:
On Uniformly Constructive and Semiconstructive Formal Systems.
Logic Journal of the IGPL 11(1): 1-49 (2003) |
| 15 |  | Mauro Ferrari,
Camillo Fiorentini:
A Proof-theoretical Analysis of Semiconstructive Intermediate Theories.
Studia Logica 73(1): 21-49 (2003) |
| 2002 |
|---|
| 14 | | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics.
LPAR 2002: 175-189 |
| 13 | | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
Tableau Calculi for the Logics of Finite k-Ary Trees.
TABLEAUX 2002: 115-129 |
| 2001 |
|---|
| 12 | | Mauro Ferrari,
Camillo Fiorentini,
Mario Ornaghi:
Extracting Exact Time Bounds from Logical Proofs.
LOPSTR 2001: 245-266 |
| 11 | | 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) |
| 2000 |
|---|
| 10 | | Alessandro Avellone,
Mauro Ferrari,
Camillo Fiorentini:
A formal framework for synthesis and verification of logic programs.
LOPSTR 2000 |
| 9 | | Alessandro Avellone,
Mauro Ferrari,
Camillo Fiorentini:
A Formal Framework for Synthesis and Verification of Logic Programs.
LOPSTR (LNCS 2042: Selected Papers) 2000: 1-17 |
| 8 | | Agata Ciabattoni,
Mauro Ferrari:
Hypertableau and Path-Hypertableau Calculi for Some Families of Intermediate Logics.
TABLEAUX 2000: 160-174 |
| 1999 |
|---|
| 7 | | Alessandro Avellone,
Mauro Ferrari,
Pierangelo Miglioli:
Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics.
Logic Journal of the IGPL 7(4): 447-480 (1999) |
| 1998 |
|---|
| 6 | | Alessandro Avellone,
Mauro Ferrari,
Pierangelo Miglioli:
Synthesis of Programs in Abstract Data Types.
LOPSTR 1998: 81-100 |
| 1997 |
|---|
| 5 | | Mauro Ferrari:
Cut-Free Tableau Calculi for some Intuitionistic Modal Logics.
Studia Logica 59(3): 303-330 (1997) |
| 1996 |
|---|
| 4 | | Alessandro Avellone,
Mauro Ferrari:
Almost Duplication-Free Tableau Calculi for Propositional Lax Logics.
TABLEAUX 1996: 48-64 |
| 1995 |
|---|
| 3 | | Mauro Ferrari,
Pierangelo Miglioli:
A Method to Single out Maximal Propositional Logics with the Disjunction Property I.
Ann. Pure Appl. Logic 76(1): 1-46 (1995) |
| 2 | | Mauro Ferrari,
Pierangelo Miglioli:
A Method to Single out Maximal Propositional Logics with the Disjunction Property II.
Ann. Pure Appl. Logic 76(2): 117-168 (1995) |
| 1993 |
|---|
| 1 | | Mauro Ferrari,
Pierangelo Miglioli:
Counting the Maximal Intermediate Constructive Logics.
J. Symb. Log. 58(4): 1365-1401 (1993) |
