Guido Fiorino

34 papers A* 1B 6Journal 18Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
New tableau characterizations for non-clausal regular MinSAT and MaxSAT problems.
Log. J. IGPL
Guido Fiorino
2023 J jnl
Linear Depth Deduction with Subformula Property for Intuitionistic Epistemic Logic.
J. Autom. Reason.
Guido Fiorino
2022 J jnl
A non-clausal tableau calculus for MinSat.
Inf. Process. Lett.
Guido Fiorino
2022 J jnl
New Tableau Characterizations for Non-clausal MaxSAT Problem.
Log. J. IGPL
Guido Fiorino
2018 — conf
Forward Countermodel Construction in Modal Logic K.
CILC
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2017 J jnl
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi.
Fundam. Informaticae
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2017 — conf
Proof-Search in Hilbert Calculi.
ICTCS/CILC
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2015 J jnl
An Evaluation-Driven Decision Procedure for G3i.
ACM Trans. Comput. Log.
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2015 — conf
Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations.
CILC
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2014 — conf
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi.
CILC
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2014 J jnl
Terminating Calculi for Propositional Dummett Logic with Subformula Property.
J. Autom. Reason.
Guido Fiorino
2013 B conf
A Terminating Evaluation-Driven Variant of G3i.
TABLEAUX
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2013 J jnl
Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models.
J. Autom. Reason.
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2012 J jnl
Simplification Rules for Intuitionistic Propositional Tableaux.
ACM Trans. Comput. Log.
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2012 J jnl
Terminating Calculi for Propositional Dummett Logic with Subformula Property
CoRR
Guido Fiorino
2011 A* conf
Refutation in Dummett Logic Using a Sign to Express the Truth at the Next Possible World.
IJCAI
Guido Fiorino
2010 B conf
A Decidable Constructive Description Logic.
JELIA
Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2010 — conf
Fast Decision Procedure for Propositional Dummett Logic Based on a Multiple Premise Tableau Calculus.
PAAR@IJCAR
Guido Fiorino
2010 J jnl
Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus.
Inf. Sci.
Guido Fiorino
2010 — conf
Tableau Calculus for Dummett Logic Based on Present and Next State of Knowledge.
IWIL@LPAR
Guido Fiorino
2010 — conf
fCube: An Efficient Prover for Intuitionistic Propositional Logic.
LPAR (Yogyakarta)
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2009 J jnl
A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications.
J. Appl. Non Class. Logics
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2008 J jnl
Optimization techniques for propositional intuitionistic logic and their implementation.
Theor. Comput. Sci.
Alessandro Avellone, Guido Fiorino, Ugo Moscato
2007 — conf
A Constructive Semantics for ALC.
Description Logics
Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2007 B conf
Improvements to the Tableau Prover PITP.
TABLEAUX
Alessandro Avellone, Guido Fiorino, Ugo Moscato
2005 — conf
ESBC: an application for computing stabilization bounds.
CLASE
Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, Ugo Moscato
2005 J jnl
On the complexity of the disjunction property in intuitionistic and modal logics.
ACM Trans. Comput. Log.
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2004 B conf
A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation.
CSL
Alessandro Avellone, Camillo Fiorentini, Guido Fiorino, Ugo Moscato
2004 J jnl
A secondary semantics for Second Order Intuitionistic Propositional Logic.
Math. Log. Q.
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2002 B conf
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics.
LPAR
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2002 J jnl
Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics.
J. Log. Comput.
Guido Fiorino
2002 B conf
Tableau Calculi for the Logics of Finite k-Ary Trees.
TABLEAUX
Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2001 J jnl
An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic.
J. Autom. Reason.
Guido Fiorino
1995 J jnl
Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions.
Inf. Process. Lett.
Alberto Bertoni, Nicolò Cesa-Bianchi, Guido Fiorino