Camillo Fiorentini
Orcid: 0000-0003-2152-7488Affiliations:
- University of Milano, Italy
According to our database1,
Camillo Fiorentini
authored at least 57 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
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
Proceedings of the 38th Italian Conference on Computational Logic, 2023
2022
Proceedings of the 37th Italian Conference on Computational Logic, Bologna, Italy, June 29, 2022
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022
2021
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
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
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
Fundam. Informaticae, 2018
Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic.
CoRR, 2018
Proceedings of the 33rd Italian Conference on Computational Logic, 2018
2017
Fundam. Informaticae, 2017
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017
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
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
J. Log. Comput., 2015
Fundam. Informaticae, 2015
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
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2013
Proceedings of the 28th Italian Conference on Computational Logic, 2013
2012
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
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010
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
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009
2008
Proceedings of the Types for Proofs and Programs, International Conference, 2008
2007
Proceedings of the Logic-Based Program Synthesis and Transformation, 2007
Proceedings of the 2007 International Workshop on Description Logics (DL2007), 2007
2005
ACM Trans. Comput. Log., 2005
Proceedings of the Workshop on the Constructive Logic for Automated Software Engineering, 2005
Proceedings of the Workshop on the Constructive Logic for Automated Software Engineering, 2005
2004
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
Theor. Comput. Sci., 2003
Stud Logica, 2003
2002
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
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
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