- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j11 |      | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: Simplification Rules for Intuitionistic Propositional Tableaux. ACM Trans. Comput. Log. 13(2): 14 (2012) |
| i1 | | Guido Fiorino: Terminating Calculi for Propositional Dummett Logic with Subformula Property. CoRR abs/1206.4458 (2012) |
| 2011 | ||
| c8 | | Guido Fiorino: Refutation in Dummett Logic Using a Sign to Express the Truth at the Next Possible World. IJCAI 2011: 869-874 |
| 2010 | ||
| j10 | | Guido Fiorino: Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus. Inf. Sci. 180(19): 3633-3646 (2010) |
| j9 | | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: BCDL\boldsymbol {\cal BC\!D\!L}: Basic Constructive Description Logic. J. Autom. Reasoning 44(4): 371-399 (2010) |
| c7 | | Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: A Decidable Constructive Description Logic. JELIA 2010: 51-63 |
| c6 | | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: fCube: An Efficient Prover for Intuitionistic Propositional Logic. LPAR (Yogyakarta) 2010: 294-301 |
| 2009 | ||
| j8 | | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications. Journal of Applied Non-Classical Logics 19(2): 149-166 (2009) |
| 2008 | ||
| j7 | | Alessandro Avellone, Guido Fiorino, Ugo Moscato: Optimization techniques for propositional intuitionistic logic and their implementation. Theor. Comput. Sci. 409(1): 41-58 (2008) |
| 2007 | ||
| c5 | | Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: A Constructive Semantics for ALC. Description Logics 2007 |
| c4 | | Alessandro Avellone, Guido Fiorino, Ugo Moscato: Improvements to the Tableau Prover PITP. TABLEAUX 2007: 233-237 |
| 2006 | ||
| j6 | | 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 | ||
| j5 | | 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 | ||
| j4 | | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: A secondary semantics for Second Order Intuitionistic Propositional Logic. Math. Log. Q. 50(2): 202-210 (2004) |
| c3 | | 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 |
| 2002 | ||
| j3 | | Guido Fiorino: Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics. J. Log. Comput. 12(6): 955-992 (2002) |
| c2 | | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics. LPAR 2002: 175-189 |
| c1 | | Mauro Ferrari, Camillo Fiorentini, Guido Fiorino: Tableau Calculi for the Logics of Finite k-Ary Trees. TABLEAUX 2002: 115-129 |
| 2001 | ||
| j2 | | Guido Fiorino: An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic. J. Autom. Reasoning 27(3): 297-311 (2001) |
| 1995 | ||
| j1 | | 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) |
| 1 | Alessandro Avellone | |
| 2 | Alberto Bertoni | |
| 3 | Loris Bozzato | |
| 4 | Nicolò Cesa-Bianchi | |
| 5 | Mauro Ferrari | |
| 6 | Camillo Fiorentini | |
| 7 | Ugo Moscato |
Colors in the list of coauthors
Last update Thu May 23 17:30:56 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page