default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuido Fiorino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Guido Fiorino
:
Linear Depth Deduction with Subformula Property for Intuitionistic Epistemic Logic. J. Autom. Reason. 67(1): 3 (2023)- 2022
- [j16]Guido Fiorino:
New Tableau Characterizations for Non-clausal MaxSAT Problem. Log. J. IGPL 30(3): 422-436 (2022) - [j15]Guido Fiorino:
A non-clausal tableau calculus for MinSat. Inf. Process. Lett. 173: 106167 (2022)
2010 – 2019
- 2018
- [c16]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Forward Countermodel Construction in Modal Logic K. CILC 2018: 75-81 - 2017
- [j14]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. Fundam. Informaticae 150(1): 119-142 (2017) - [c15]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Proof-Search in Hilbert Calculi. ICTCS/CILC 2017: 301-305 - 2015
- [j13]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
An Evaluation-Driven Decision Procedure for G3i. ACM Trans. Comput. Log. 16(1): 8:1-8:37 (2015) - [c14]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations. CILC 2015: 117-121 - 2014
- [j12]Guido Fiorino:
Terminating Calculi for Propositional Dummett Logic with Subformula Property. J. Autom. Reason. 52(1): 67-97 (2014) - [c13]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. CILC 2014: 46-53 - 2013
- [j11]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models. J. Autom. Reason. 51(2): 129-149 (2013) - [c12]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
A Terminating Evaluation-Driven Variant of G3i. TABLEAUX 2013: 104-118 - 2012
- [j10]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Simplification Rules for Intuitionistic Propositional Tableaux. ACM Trans. Comput. Log. 13(2): 14:1-14:23 (2012) - [i1]Guido Fiorino:
Terminating Calculi for Propositional Dummett Logic with Subformula Property. CoRR abs/1206.4458 (2012) - 2011
- [c11]Guido Fiorino:
Refutation in Dummett Logic Using a Sign to Express the Truth at the Next Possible World. IJCAI 2011: 869-874 - 2010
- [j9]Guido Fiorino:
Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus. Inf. Sci. 180(19): 3633-3646 (2010) - [j8]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
BCDL\boldsymbol {\cal BC\!D\!L}: Basic Constructive Description Logic. J. Autom. Reason. 44(4): 371-399 (2010) - [c10]Guido Fiorino:
Fast Decision Procedure for Propositional Dummett Logic Based on a Multiple Premise Tableau Calculus. PAAR@IJCAR 2010: 52-62 - [c9]Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
A Decidable Constructive Description Logic. JELIA 2010: 51-63 - [c8]Guido Fiorino:
Tableau Calculus for Dummett Logic Based on Present and Next State of Knowledge. IWIL@LPAR 2010: 17-32 - [c7]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
fCube: An Efficient Prover for Intuitionistic Propositional Logic. LPAR (Yogyakarta) 2010: 294-301
2000 – 2009
- 2009
- [j7]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications. J. Appl. Non Class. Logics 19(2): 149-166 (2009) - 2008
- [j6]Alessandro Avellone, Guido Fiorino, Ugo Moscato:
Optimization techniques for propositional intuitionistic logic and their implementation. Theor. Comput. Sci. 409(1): 41-58 (2008) - 2007
- [c6]Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
A Constructive Semantics for ALC. Description Logics 2007 - [c5]Alessandro Avellone, Guido Fiorino, Ugo Moscato:
Improvements to the Tableau Prover PITP. TABLEAUX 2007: 233-237 - 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) - [c4]Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, Ugo Moscato:
ESBC: an application for computing stabilization bounds. CLASE 2005: 23-33 - 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. Reason. 27(3): 297-311 (2001)
1990 – 1999
- 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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
