| 2008 |
|---|
| 12 | EE | Alessandro Avellone,
Guido Fiorino,
Ugo Moscato:
Optimization techniques for propositional intuitionistic logic and their implementation.
Theor. Comput. Sci. 409(1): 41-58 (2008) |
| 2007 |
|---|
| 11 | EE | Loris Bozzato,
Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
A Constructive Semantics for ALC.
Description Logics 2007 |
| 10 | EE | Alessandro Avellone,
Guido Fiorino,
Ugo Moscato:
Improvements to the Tableau Prover PITP.
TABLEAUX 2007: 233-237 |
| 2006 |
|---|
| 9 | 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) |
| 2005 |
|---|
| 8 | 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 |
|---|
| 7 | 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 |
| 6 | EE | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
A secondary semantics for Second Order Intuitionistic Propositional Logic.
Math. Log. Q. 50(2): 202-210 (2004) |
| 2002 |
|---|
| 5 | EE | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics.
LPAR 2002: 175-189 |
| 4 | EE | Mauro Ferrari,
Camillo Fiorentini,
Guido Fiorino:
Tableau Calculi for the Logics of Finite k-Ary Trees.
TABLEAUX 2002: 115-129 |
| 3 | EE | Guido Fiorino:
Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics.
J. Log. Comput. 12(6): 955-992 (2002) |
| 2001 |
|---|
| 2 | | Guido Fiorino:
An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic.
J. Autom. Reasoning 27(3): 297-311 (2001) |
| 1995 |
|---|
| 1 | EE | Alberto Bertoni,
Nicolò Cesa-Bianchi,
Guido Fiorino:
Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions.
Inf. Process. Lett. 56(1): 15-17 (1995) |
