Guido Fiorino

ACM Trans. Comput. Log., 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

2014

Terminating Calculi for Propositional Dummett Logic with Subformula Property.

[BibT_eX]

[DOI]

J. Autom. Reason., 2014

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

2011

Refutation in Dummett Logic Using a Sign to Express the Truth at the Next Possible World.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

2010

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

[BibT_eX]

[DOI]

J. Autom. Reason., 2010

Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus.

[BibT_eX]

[DOI]

Inf. Sci., 2010

Tableau Calculus for Dummett Logic Based on Present and Next State of Knowledge.

[BibT_eX]

[DOI]

Proceedings of the 8th International Workshop on the Implementation of Logics, 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

2008

Optimization techniques for propositional intuitionistic logic and their implementation.

[BibT_eX]

[DOI]

Alessandro Avellone

Ugo Moscato

Theor. Comput. Sci., 2008

2007

Improvements to the Tableau Prover PITP.

[BibT_eX]

[DOI]

Alessandro Avellone

Ugo Moscato

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 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

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

A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2002

Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics.

[BibT_eX]

[DOI]

J. Log. Comput., 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

An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic.

[BibT_eX]

[DOI]

J. Autom. Reason., 2001

1995

Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions.

[BibT_eX]

[DOI]

Alberto Bertoni

Nicolò Cesa-Bianchi