Camillo Fiorentini

Orcid: 0000-0003-2152-7488

Affiliations:
  • University of Milano, Italy


According to our database1, Camillo Fiorentini authored at least 57 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • 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

Efficient SAT-based Proof Search in Intuitionistic Propositional Logic.
Proceedings of the Automated Deduction - CADE 28, 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

Connections Between Answer Set Semantics and Information Terms Semantics in Constructive EL_bot (Extended Abstract).
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 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

Reasoning on Information Term Semantics with ASP for Constructive ELꓕ.
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

A Proof-Theoretic Perspective on SMT-Solving for Intuitionistic Propositional Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
Preface.
Fundam. Informaticae, 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

LOGI: A Didactic Tool for a Beginners' Course in Logic (System Description).
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

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

Terminating sequent calculi for proving and refuting formulas in S4.
J. Log. Comput., 2015

A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic.
Fundam. Informaticae, 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

Focusing on Contraction.
Proceedings of the 28th Italian Conference on Computational Logic, 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

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

A Constructive Approach to Testing Model Transformations.
Proceedings of the Theory and Practice of Model Transformations, 2010

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

Applying ASP to UML Model Validation.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

2008
Towards a Type Discipline for Answer Set Programming.
Proceedings of the Types for Proofs and Programs, International Conference, 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

A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
Combining word problems through rewriting in categories with products.
Theor. Comput. Sci., 2003

A Proof-theoretical Analysis of Semiconstructive Intermediate Theories.
Stud Logica, 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
Hypercanonicity, Extensive Canonicity, Canonicity and Strong Completeness of Intermediate Propositional Logics.
Reports Math. Log., 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
All Intermediate Logics with Extra Axions in One Variable, Except Eight, Are Not Strongly omega-Complete.
J. Symb. Log., 2000

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

1999
A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications.
Log. J. IGPL, 1999

1996
On maximal intermediate predicate constructive logics.
Stud Logica, 1996


  Loading...