Camillo Fiorentini

发表

Extracting information from intermediate T-systems

P. Miglioli, Mauro Ferrari, N. Interno, 2000 .

CAMILLO FI RENTINI Intermendiate Predicate PAOLO MANTOVANI Constructive Logics

P. Miglioli, A. Avellone, Paolo Mantovani, 2008 .

Snapshots generation via constructive logic

A. Momigliano, Mario Ornaghi, Camillo Fiorentini, 2005 .

Path Rewriting and Combined Word Problems

S. Ghilardi, Camillo Fiorentini, 2003 .

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

Camillo Fiorentini, Alessandro Avellone, Guido Fiorino, 2004, CSL.

Extracting Exact Time Bounds from Logical Proofs

Mauro Ferrari, Mario Ornaghi, Camillo Fiorentini, 2001, LOPSTR.

Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic

Mauro Ferrari, Camillo Fiorentini, Mauro Ferrari, 2017, Journal of Automated Reasoning.

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

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2010, Journal of Automated Reasoning.

A Constructive Semantics for ALC

Mauro Ferrari, Camillo Fiorentini, Loris Bozzato, 2007, Description Logics.

A Formal Framework for Synthesis and Verification of Logic Programs

Mauro Ferrari, Camillo Fiorentini, Alessandro Avellone, 2000, LOPSTR.

On maximal intermediate predicate constructive logics

Pierangelo Miglioli, Camillo Fiorentini, Alessandro Avellone, 1996, Stud Logica.

A Constructive Approach to Testing Model Transformations

Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano, 2010, ICMT@TOOLS.

Terminating sequent calculi for proving and refuting formulas in S4

Camillo Fiorentini, Camillo Fiorentini, 2015, J. Log. Comput..

An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic

Camillo Fiorentini, Camillo Fiorentini, 2019, IJCAI.

Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic

Mauro Ferrari, Camillo Fiorentini, Mauro Ferrari, 2018, ACM Trans. Comput. Log..

A Forward Unprovability Calculus for Intuitionistic Propositional Logic

Mauro Ferrari, Camillo Fiorentini, Mauro Ferrari, 2017, TABLEAUX.

An Evaluation-Driven Decision Procedure for G3i

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2015, ACM Trans. Comput. Log..

A Terminating Evaluation-Driven Variant of G3i

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2013, TABLEAUX.

Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2013, Journal of Automated Reasoning.

Simplification Rules for Intuitionistic Propositional Tableaux

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2012, TOCL.

fCube: An Efficient Prover for Intuitionistic Propositional Logic

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2010, LPAR.

A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2009, J. Appl. Non Class. Logics.

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

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2005, TOCL.

A Proof-theoretical Analysis of Semiconstructive Intermediate Theories

Mauro Ferrari, Camillo Fiorentini, Mauro Ferrari, 2003, Stud Logica.

Tableau Calculi for the Logics of Finite k-Ary Trees

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2002, TABLEAUX.

Forward proof-search and Countermodel Construction in Intuitionistic Propositional Logic

Mauro Ferrari, Camillo Fiorentini, Mauro Ferrari, 2020, ICTCS.

Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic

Mauro Ferrari, Camillo Fiorentini, 2017, Journal of automated reasoning.

Focusing on Contraction

Camillo Fiorentini, Alberto Momigliano, Alessandro Avellone, 2013, CILC.

Towards the use of simplification rules in intuitionistic tableaux

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2009 .

Hypercanonicity, Extensive Canonicity, Canonicity and Strong Completeness of Intermediate Propositional Logics

Camillo Fiorentini, Camillo Fiorentini, 2001, Reports Math. Log..

Kripke completeness for intermediate logics

Camillo Fiorentini, Camillo Fiorentini, 2000 .

A Natural Deduction Calculus for Gödel-Dummett Logic Internalizing Proof-search Control Mechanisms

Mauro Ferrari, Camillo Fiorentini, Mauro Ferrari, 2020, CILC.

A Sequent Based On-the-fly Procedure to Get Hilbert Proofs in Classical Propositional Logic

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2019 .

Proof-Search in Natural Deduction Calculus for Classical Propositional Logic

Mauro Ferrari, Camillo Fiorentini, Mauro Ferrari, 2015, TABLEAUX.

JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2014, CILC.

Combining word problems through rewriting in categories with products

Silvio Ghilardi, Camillo Fiorentini, S. Ghilardi, 2003, Theor. Comput. Sci..

Forward refutation for Gödel-Dummett Logics

Mauro Ferrari, Camillo Fiorentini, 2022, CILC.

Towards a Type Discipline for Answer Set Programming

Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano, 2009, TYPES.

A forward internal calculus for model generation in S4

Camillo Fiorentini, Mauro Ferrari, Mauro Ferrari, 2021, J. Log. Comput..

Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino, 2015, CILC.

Tests and Proofs : Papers Presented at the Second International Conference TAP 2008 Prato , Italy , April 2008

B. Meyer, Wolfram Schulte, Mario Ornaghi, 2008 .