default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMauro Ferrari 0002
Person information
- affiliation: University of Insubria, Varese, Italy
- affiliation (former): University of Milan, Italy
Other persons with the same name
- Mauro Ferrari 0001
![[0000-0001-7042-0236]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-7042-0236")
— University of Pisa, Department of Translational Research and New Technologies in Medicine and Surgery, Italy - Mauro Ferrari 0003 — Houston Methodist Research Institute, Department of Nanomedicine, Houston, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Camillo Fiorentini, Mauro Ferrari:
General Clauses for SAT-Based Proof Search in Intuitionistic Propositional Logic. J. Autom. Reason. 68(3): 13 (2024)- [c30]Camillo Fiorentini, Mauro Ferrari:
A Terminating Sequent Calculus for Intuitionistic Strong Löb Logic with the Subformula Property. IJCAR (2) 2024: 24-42 - 2023
- [c29]Camillo Fiorentini, Mauro Ferrari:
A New Approach to Clausification for Intuitionistic Propositional Logic. CILC 2023 - 2022
- [c28]Camillo Fiorentini, Mauro Ferrari:
SAT-Based Proof Search in Intermediate Propositional Logics. IJCAR 2022: 57-74 - [c27]Camillo Fiorentini, Mauro Ferrari:
Forward refutation for Gödel-Dummett Logics. CILC 2022: 171-185 - 2021
- [j21]Camillo Fiorentini, Mauro Ferrari:
A forward internal calculus for model generation in S4. J. Log. Comput. 31(3): 771-796 (2021) - 2020
- [j20]Camillo Fiorentini, Mauro Ferrari:
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic. ACM Trans. Comput. Log. 21(3): 22:1-22:47 (2020) - [c26]Camillo Fiorentini, Mauro Ferrari:
A Natural Deduction Calculus for Gödel-Dummett Logic Internalizing Proof-search Control Mechanisms. CILC 2020: 91-104 - [c25]Camillo Fiorentini, Mauro Ferrari:
Forward proof-search and Countermodel Construction in Intuitionistic Propositional Logic. ICTCS 2020: 230-235
2010 – 2019
- 2019
- [j19]Mauro Ferrari, Camillo Fiorentini:
Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic. J. Autom. Reason. 62(1): 127-167 (2019) - 2018
- [j18]Mauro Ferrari, Camillo Fiorentini, Alberto Momigliano:
From Constructivism to Logic Programming: an Homage to Mario Ornaghi. Fundam. Informaticae 161(1-2): 1-7 (2018) - [c24]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Forward Countermodel Construction in Modal Logic K. CILC 2018: 75-81 - [i2]Camillo Fiorentini, Mauro Ferrari:
Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic. CoRR abs/1804.06689 (2018) - 2017
- [j17]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. Fundam. Informaticae 150(1): 119-142 (2017) - [c23]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Proof-Search in Hilbert Calculi. ICTCS/CILC 2017: 301-305 - [c22]Camillo Fiorentini, Mauro Ferrari:
A Forward Unprovability Calculus for Intuitionistic Propositional Logic. TABLEAUX 2017: 114-130 - 2015
- [j16]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
An Evaluation-Driven Decision Procedure for G3i. ACM Trans. Comput. Log. 16(1): 8:1-8:37 (2015) - [c21]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 - [c20]Mauro Ferrari, Camillo Fiorentini:
Proof-Search in Natural Deduction Calculus for Classical Propositional Logic. TABLEAUX 2015: 237-252 - 2014
- [c19]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. CILC 2014: 46-53 - 2013
- [j15]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) - [c18]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
A Terminating Evaluation-Driven Variant of G3i. TABLEAUX 2013: 104-118 - 2012
- [j14]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Simplification Rules for Intuitionistic Propositional Tableaux. ACM Trans. Comput. Log. 13(2): 14:1-14:23 (2012) - 2010
- [j13]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
BCDL\boldsymbol {\cal BC\!D\!L}: Basic Constructive Description Logic. J. Autom. Reason. 44(4): 371-399 (2010) - [c17]Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
A Decidable Constructive Description Logic. JELIA 2010: 51-63 - [c16]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
fCube: An Efficient Prover for Intuitionistic Propositional Logic. LPAR (Yogyakarta) 2010: 294-301 - [c15]Loris Bozzato, Mauro Ferrari:
Composition of Semantic Web Services in a Constructive Description Logic. RR 2010: 223-226 - [i1]Loris Bozzato, Mauro Ferrari:
A Note on Semantic Web Services Specification and Composition in Constructive Description Logics. CoRR abs/1007.2364 (2010)
2000 – 2009
- 2009
- [j12]Loris Bozzato, Mauro Ferrari, Paola Villa:
Actions Over a Constructive Semantics for Description Logics. Fundam. Informaticae 96(3): 253-269 (2009) - [j11]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
- [c14]Loris Bozzato, Mauro Ferrari, Paola Villa:
Actions over a Constructive Semantics for ALC. Description Logics 2008 - [c13]Loris Bozzato, Mauro Ferrari, Alberto Trombetta:
Building a Domain Ontology from Glossaries: A General Methodology. SWAP 2008 - 2007
- [c12]Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
A Constructive Semantics for ALC. Description Logics 2007 - [c11]Mauro Ferrari, Camillo Fiorentini, Alberto Momigliano, Mario Ornaghi:
Snapshot Generation in a Constructive Object-Oriented Modeling Language. LOPSTR 2007: 169-184 - 2005
- [j10]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) - [c10]Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, Ugo Moscato:
ESBC: an application for computing stabilization bounds. CLASE 2005: 23-33 - [c9]Mario Ornaghi, Marco Benini, Mauro Ferrari, Camillo Fiorentini, Alberto Momigliano:
A Constructive Object Oriented Modeling Language for Information Systems. CLASE 2005: 55-75 - 2004
- [j9]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
A secondary semantics for Second Order Intuitionistic Propositional Logic. Math. Log. Q. 50(2): 202-210 (2004) - 2003
- [j8]Mauro Ferrari, Pierangelo Miglioli, Mario Ornaghi:
On Uniformly Constructive and Semiconstructive Formal Systems. Log. J. IGPL 11(1): 1-49 (2003) - [j7]Mauro Ferrari, Camillo Fiorentini:
A Proof-theoretical Analysis of Semiconstructive Intermediate Theories. Stud Logica 73(1): 21-49 (2003) - 2002
- [c8]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics. LPAR 2002: 175-189 - [c7]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Tableau Calculi for the Logics of Finite k-Ary Trees. TABLEAUX 2002: 115-129 - 2001
- [j6]Mauro Ferrari, Camillo Fiorentini, Pierangelo Miglioli:
Extracting information from intermediate semiconstructive HA-systems - extended abstract. Math. Struct. Comput. Sci. 11(4): 589-596 (2001) - [c6]Mauro Ferrari, Camillo Fiorentini, Mario Ornaghi:
Extracting Exact Time Bounds from Logical Proofs. LOPSTR 2001: 245-266 - 2000
- [c5]Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini:
A formal framework for synthesis and verification of logic programs. LOPSTR 2000 - [c4]Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini:
A Formal Framework for Synthesis and Verification of Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 1-17 - [c3]Agata Ciabattoni, Mauro Ferrari:
Hypertableau and Path-Hypertableau Calculi for Some Families of Intermediate Logics. TABLEAUX 2000: 160-174
1990 – 1999
- 1999
- [j5]Alessandro Avellone, Mauro Ferrari, Pierangelo Miglioli:
Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Log. J. IGPL 7(4): 447-480 (1999) - 1998
- [c2]Alessandro Avellone, Mauro Ferrari, Pierangelo Miglioli:
Synthesis of Programs in Abstract Data Types. LOPSTR 1998: 81-100 - 1997
- [j4]Mauro Ferrari:
Cut-Free Tableau Calculi for some Intuitionistic Modal Logics. Stud Logica 59(3): 303-330 (1997) - 1996
- [c1]Alessandro Avellone, Mauro Ferrari:
Almost Duplication-Free Tableau Calculi for Propositional Lax Logics. TABLEAUX 1996: 48-64 - 1995
- [j3]Mauro Ferrari, Pierangelo Miglioli:
A Method to Single out Maximal Propositional Logics with the Disjunction Property I. Ann. Pure Appl. Log. 76(1): 1-46 (1995) - [j2]Mauro Ferrari, Pierangelo Miglioli:
A Method to Single out Maximal Propositional Logics with the Disjunction Property II. Ann. Pure Appl. Log. 76(2): 117-168 (1995) - 1993
- [j1]Mauro Ferrari, Pierangelo Miglioli:
Counting the Maximal Intermediate Constructive Logics. J. Symb. Log. 58(4): 1365-1401 (1993)
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 2024-10-07 22:05 CEST 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:
