Guido Fiorino - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2023

Linear Depth Deduction with Subformula Property for Intuitionistic Epistemic LogicGuido Fiorino. JAR, 67(1):3, 2023. [doi]

2022

A non-clausal tableau calculus for MinSatGuido Fiorino. ipl, 173:106167, 2022. [doi]

New Tableau Characterizations for Non-clausal MaxSAT ProblemGuido Fiorino. igpl, 30(3):422-436, 2022. [doi]

2018

Forward Countermodel Construction in Modal Logic KMauro Ferrari, Camillo Fiorentini, Guido Fiorino. cilc 2018: 75-81 [doi]

2017

JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau CalculiMauro Ferrari, Camillo Fiorentini, Guido Fiorino. FUIN, 150(1):119-142, 2017. [doi]

JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau CalculiMauro Ferrari, Camillo Fiorentini, Guido Fiorino. FUIN, 150(1):119-142, 2017. [doi]

Proof-Search in Hilbert CalculiMauro Ferrari, Camillo Fiorentini, Guido Fiorino. ictcs 2017: 301-305 [doi]

2015

An Evaluation-Driven Decision Procedure for G3iMauro Ferrari, Camillo Fiorentini, Guido Fiorino. tocl, 16(1), 2015. [doi]

Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizationsMauro Ferrari, Camillo Fiorentini, Guido Fiorino. cilc 2015: 117-121 [doi]

2014

JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau CalculiMauro Ferrari, Camillo Fiorentini, Guido Fiorino. cilc 2014: 46-53 [doi]

Terminating Calculi for Propositional Dummett Logic with Subformula PropertyGuido Fiorino. JAR, 52(1):67-97, 2014. [doi]

2013

A Terminating Evaluation-Driven Variant of G3iMauro Ferrari, Camillo Fiorentini, Guido Fiorino. tableaux 2013: 104-118 [doi]

Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-ModelsMauro Ferrari, Camillo Fiorentini, Guido Fiorino. JAR, 51(2):129-149, 2013. [doi]

2012

Simplification Rules for Intuitionistic Propositional TableauxMauro Ferrari, Camillo Fiorentini, Guido Fiorino. tocl, 13(2):14, 2012. [doi]

2011

Refutation in Dummett Logic Using a Sign to Express the Truth at the Next Possible WorldGuido Fiorino. IJCAI 2011: 869-874 [doi]

2010

A Decidable Constructive Description LogicLoris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino. jelia 2010: 51-63 [doi]

::::BC::::::::D::::::::L::::/boldsymbol {/cal BC/!D/!L}: Basic Constructive Description LogicMauro Ferrari, Camillo Fiorentini, Guido Fiorino. JAR, 44(4):371-399, 2010. [doi]

fCube: An Efficient Prover for Intuitionistic Propositional LogicMauro Ferrari, Camillo Fiorentini, Guido Fiorino. lpar 2010: 294-301 [doi]

Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculusGuido Fiorino. isci, 180(19):3633-3646, 2010. [doi]

Tableau Calculus for Dummett Logic Based on Present and Next State of KnowledgeGuido Fiorino. lpar 2012: 17-32 [doi]

Fast Decision Procedure for Propositional Dummett Logic Based on a Multiple Premise Tableau CalculusGuido Fiorino. cade 2012: 52-62 [doi]

2009

A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implicationsMauro Ferrari, Camillo Fiorentini, Guido Fiorino. jancl, 19(2):149-166, 2009. [doi]

2008

Optimization techniques for propositional intuitionistic logic and their implementationAlessandro Avellone, Guido Fiorino, Ugo Moscato. TCS, 409(1):41-58, 2008. [doi]

2007

Improvements to the Tableau Prover PITPAlessandro Avellone, Guido Fiorino, Ugo Moscato. tableaux 2007: 233-237 [doi]

A Constructive Semantics for ALCLoris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino. dlog 2007: [doi]

2006

ESBC: an application for computing stabilization boundsAlessandro Avellone, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, Ugo Moscato. ENTCS, 153(1):23-33, 2006. [doi]

2005

On the complexity of the disjunction property in intuitionistic and modal logicsMauro Ferrari, Camillo Fiorentini, Guido Fiorino. tocl, 6(3):519-538, 2005. [doi]

2004

A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive NegationAlessandro Avellone, Camillo Fiorentini, Guido Fiorino, Ugo Moscato. csl 2004: 488-502 [doi]

A secondary semantics for Second Order Intuitionistic Propositional LogicMauro Ferrari, Camillo Fiorentini, Guido Fiorino. mlq, 50(2):202-210, 2004. [doi]

2002

On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate LogicsMauro Ferrari, Camillo Fiorentini, Guido Fiorino. lpar 2002: 175-189 [doi]

Tableau Calculi for the Logics of Finite k-Ary TreesMauro Ferrari, Camillo Fiorentini, Guido Fiorino. tableaux 2002: 115-129 [doi]

Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate LogicsGuido Fiorino. logcom, 12(6):955-992, 2002. [doi]

2001

An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett LogicGuido Fiorino. JAR, 27(3):297-311, 2001.

1995

Efficient Learning with Equivalence Queries of Conjunctions of Modulo FunctionsAlberto Bertoni, Nicolò Cesa-Bianchi, Guido Fiorino. ipl, 56(1):15-17, 1995. [doi]

Sign in or sign up to see more results.

runs on WebDSL