Mauro Ferrari

ACM Trans. Comput. Log., 2015

Proof-Search in Natural Deduction Calculus for Classical Propositional Logic.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Autom. Reason., 2013

A Terminating Evaluation-Driven Variant of G3i.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2013

2012

Simplification Rules for Intuitionistic Propositional Tableaux.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2012

2010

BCDL\boldsymbol {\cal BC\!D\!L}: Basic Constructive Description Logic.

[BibT_eX]

[DOI]

J. Autom. Reason., 2010

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

[BibT_eX]

[DOI]

CoRR, 2010

Composition of Semantic Web Services in a Constructive Description Logic.

[BibT_eX]

[DOI]

Proceedings of the Web Reasoning and Rule Systems - Fourth International Conference, 2010

fCube: An Efficient Prover for Intuitionistic Propositional Logic.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

A Decidable Constructive Description Logic.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2009

Actions Over a Constructive Semantics for Description Logics.

[BibT_eX]

[DOI]

Paola Villa

Fundam. Informaticae, 2009

2008

Building a Domain Ontology from Glossaries: A General Methodology.

[BibT_eX]

[DOI]

Alberto Trombetta

Proceedings of the 5th Workshop on Semantic Web Applications and Perspectives (SWAP2008), 2008

Actions over a Constructive Semantics for ALC.

[BibT_eX]

[DOI]

Paola Villa

Proceedings of the 21st International Workshop on Description Logics (DL2008), 2008

2007

Snapshot Generation in a Constructive Object-Oriented Modeling Language.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

A Constructive Semantics for ALC.

[BibT_eX]

[DOI]

Proceedings of the 2007 International Workshop on Description Logics (DL2007), 2007

2005

On the complexity of the disjunction property in intuitionistic and modal logics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2005

A Constructive Object Oriented Modeling Language for Information Systems.

[BibT_eX]

[DOI]

Proceedings of the Workshop on the Constructive Logic for Automated Software Engineering, 2005

ESBC: an application for computing stabilization bounds.

[BibT_eX]

[DOI]

Proceedings of the Workshop on the Constructive Logic for Automated Software Engineering, 2005

2004

A secondary semantics for Second Order Intuitionistic Propositional Logic.

[BibT_eX]

[DOI]

Math. Log. Q., 2004

2003

A Proof-theoretical Analysis of Semiconstructive Intermediate Theories.

[BibT_eX]

[DOI]

Stud Logica, 2003

On Uniformly Constructive and Semiconstructive Formal Systems.

[BibT_eX]

[DOI]

Mario Ornaghi

Log. J. IGPL, 2003

2002

Tableau Calculi for the Logics of Finite k-Ary Trees.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2002

2001

Extracting information from intermediate semiconstructive HA-systems - extended abstract.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2001

Extracting Exact Time Bounds from Logical Proofs.

[BibT_eX]

[DOI]

Mario Ornaghi

Proceedings of the Logic Based Program Synthesis and Transformation, 2001

2000

Hypertableau and Path-Hypertableau Calculi for Some Families of Intermediate Logics.

[BibT_eX]

[DOI]

Agata Ciabattoni

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

A Formal Framework for Synthesis and Verification of Logic Programs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Log. J. IGPL, 1999

1998

Synthesis of Programs in Abstract Data Types.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997

Cut-Free Tableau Calculi for some Intuitionistic Modal Logics.

[BibT_eX]

[DOI]

Stud Logica, 1997

1996

Almost Duplication-Free Tableau Calculi for Propositional Lax Logics.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1995

A Method to Single out Maximal Propositional Logics with the Disjunction Property I.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1995

1993

Counting the Maximal Intermediate Constructive Logics.

[BibT_eX]

[DOI]