Mauro Ferrari

Orcid: 0000-0002-7904-1125

Affiliations:
  • University of Insubria, Varese, Italy
  • University of Milan, Italy (former)


According to our database1, Mauro Ferrari authored at least 52 papers between 1993 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
General Clauses for SAT-Based Proof Search in Intuitionistic Propositional Logic.
J. Autom. Reason., September, 2024

A Terminating Sequent Calculus for Intuitionistic Strong Löb Logic with the Subformula Property.
Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

2023
A New Approach to Clausification for Intuitionistic Propositional Logic.
Proceedings of the 38th Italian Conference on Computational Logic, 2023

2022
Forward refutation for Gödel-Dummett Logics.
Proceedings of the 37th Italian Conference on Computational Logic, Bologna, Italy, June 29, 2022

SAT-Based Proof Search in Intermediate Propositional Logics.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

2021
A forward internal calculus for model generation in S4.
J. Log. Comput., 2021

2020
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic.
ACM Trans. Comput. Log., 2020

Forward proof-search and Countermodel Construction in Intuitionistic Propositional Logic.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

A Natural Deduction Calculus for Gödel-Dummett Logic Internalizing Proof-search Control Mechanisms.
Proceedings of the 35th Italian Conference on Computational Logic, 2020

2019
Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic.
J. Autom. Reason., 2019

2018
From Constructivism to Logic Programming: an Homage to Mario Ornaghi.
Fundam. Informaticae, 2018

Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic.
CoRR, 2018

Forward Countermodel Construction in Modal Logic K.
Proceedings of the 33rd Italian Conference on Computational Logic, 2018

2017
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi.
Fundam. Informaticae, 2017

A Forward Unprovability Calculus for Intuitionistic Propositional Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

Proof-Search in Hilbert Calculi.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

2015
An Evaluation-Driven Decision Procedure for G3i.
ACM Trans. Comput. Log., 2015

Proof-Search in Natural Deduction Calculus for Classical Propositional Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations.
Proceedings of the 30th Italian Conference on Computational Logic, 2015

2013
Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models.
J. Autom. Reason., 2013

A Terminating Evaluation-Driven Variant of G3i.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2013

2012
Simplification Rules for Intuitionistic Propositional Tableaux.
ACM Trans. Comput. Log., 2012

2010
<i>BC</i><i>D</i><i>L</i>\boldsymbol {\cal BC\!D\!L}: Basic Constructive Description Logic.
J. Autom. Reason., 2010

A Note on Semantic Web Services Specification and Composition in Constructive Description Logics
CoRR, 2010

Composition of Semantic Web Services in a Constructive Description Logic.
Proceedings of the Web Reasoning and Rule Systems - Fourth International Conference, 2010

fCube: An Efficient Prover for Intuitionistic Propositional Logic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

A Decidable Constructive Description Logic.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

2009
A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications.
J. Appl. Non Class. Logics, 2009

Actions Over a Constructive Semantics for Description Logics.
Fundam. Informaticae, 2009

2008
Building a Domain Ontology from Glossaries: A General Methodology.
Proceedings of the 5th Workshop on Semantic Web Applications and Perspectives (SWAP2008), 2008

Actions over a Constructive Semantics for ALC.
Proceedings of the 21st International Workshop on Description Logics (DL2008), 2008

2007
Snapshot Generation in a Constructive Object-Oriented Modeling Language.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

A Constructive Semantics for ALC.
Proceedings of the 2007 International Workshop on Description Logics (DL2007), 2007

2005
On the complexity of the disjunction property in intuitionistic and modal logics.
ACM Trans. Comput. Log., 2005

A Constructive Object Oriented Modeling Language for Information Systems.
Proceedings of the Workshop on the Constructive Logic for Automated Software Engineering, 2005

ESBC: an application for computing stabilization bounds.
Proceedings of the Workshop on the Constructive Logic for Automated Software Engineering, 2005

2004
A secondary semantics for Second Order Intuitionistic Propositional Logic.
Math. Log. Q., 2004

2003
A Proof-theoretical Analysis of Semiconstructive Intermediate Theories.
Stud Logica, 2003

On Uniformly Constructive and Semiconstructive Formal Systems.
Log. J. IGPL, 2003

2002
Tableau Calculi for the Logics of Finite k-Ary Trees.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics.
Proceedings of the Logic for Programming, 2002

2001
Extracting information from intermediate semiconstructive HA-systems - extended abstract.
Math. Struct. Comput. Sci., 2001

Extracting Exact Time Bounds from Logical Proofs.
Proceedings of the Logic Based Program Synthesis and Transformation, 2001

2000
Hypertableau and Path-Hypertableau Calculi for Some Families of Intermediate Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

A Formal Framework for Synthesis and Verification of Logic Programs.
Proceedings of the Logic Based Program Synthesis and Transformation, 2000

1999
Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics.
Log. J. IGPL, 1999

1998
Synthesis of Programs in Abstract Data Types.
Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997
Cut-Free Tableau Calculi for some Intuitionistic Modal Logics.
Stud Logica, 1997

1996
Almost Duplication-Free Tableau Calculi for Propositional Lax Logics.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1996

1995
A Method to Single out Maximal Propositional Logics with the Disjunction Property II.
Ann. Pure Appl. Log., 1995

A Method to Single out Maximal Propositional Logics with the Disjunction Property I.
Ann. Pure Appl. Log., 1995

1993
Counting the Maximal Intermediate Constructive Logics.
J. Symb. Log., 1993


  Loading...