default search action
Camillo Fiorentini
Person information
- affiliation: University of Milano, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Camillo Fiorentini, Mauro Ferrari:
General Clauses for SAT-Based Proof Search in Intuitionistic Propositional Logic. J. Autom. Reason. 68(3): 13 (2024) - [c35]Camillo Fiorentini
, Mauro Ferrari
A Terminating Sequent Calculus for Intuitionistic Strong Löb Logic with the Subformula Property. IJCAR (2) 2024: 24-42 - 2023
- [c34]Camillo Fiorentini, Mauro Ferrari:
A New Approach to Clausification for Intuitionistic Propositional Logic. CILC 2023 - 2022
- [c33]Camillo Fiorentini
SAT-Based Proof Search in Intermediate Propositional Logics. IJCAR 2022: 57-74 - [c32]Camillo Fiorentini, Mauro Ferrari:
Forward refutation for Gödel-Dummett Logics. CILC 2022: 171-185 - 2021
- [j22]Camillo Fiorentini, Mauro Ferrari
A forward internal calculus for model generation in S4. J. Log. Comput. 31(3): 771-796 (2021) - [c31]Camillo Fiorentini
Efficient SAT-based Proof Search in Intuitionistic Propositional Logic. CADE 2021: 217-233 - 2020
- [j21]Camillo Fiorentini
Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic. ACM Trans. Comput. Log. 21(3): 22:1-22:47 (2020) - [c30]Camillo Fiorentini, Mauro Ferrari:
A Natural Deduction Calculus for Gödel-Dummett Logic Internalizing Proof-search Control Mechanisms. CILC 2020: 91-104 - [c29]Loris Bozzato, Camillo Fiorentini:
Reasoning on Information Term Semantics with ASP for Constructive ELꓕ. CILC 2020: 141-156 - [c28]Loris Bozzato, Camillo Fiorentini:
Connections Between Answer Set Semantics and Information Terms Semantics in Constructive EL_bot (Extended Abstract). Description Logics 2020 - [c27]Camillo Fiorentini, Mauro Ferrari:
Forward proof-search and Countermodel Construction in Intuitionistic Propositional Logic. ICTCS 2020: 230-235
2010 – 2019
- 2019
- [j20]Mauro Ferrari
Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic. J. Autom. Reason. 62(1): 127-167 (2019) - [c26]Camillo Fiorentini:
An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic. IJCAI 2019: 1675-1681 - [c25]Camillo Fiorentini, Rajeev Goré, Stéphane Graham-Lengrand:
A Proof-Theoretic Perspective on SMT-Solving for Intuitionistic Propositional Logic. TABLEAUX 2019: 111-129 - 2018
- [j19]Mauro Ferrari
From Constructivism to Logic Programming: an Homage to Mario Ornaghi. Fundam. Informaticae 161(1-2): 1-7 (2018) - [j18]Camillo Fiorentini
Preface. Fundam. Informaticae 161(1-2): v-vii (2018) - [c24]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Forward Countermodel Construction in Modal Logic K. CILC 2018: 75-81 - [i1]Camillo Fiorentini, Mauro Ferrari:
Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic. CoRR abs/1804.06689 (2018) - 2017
- [j17]Mauro Ferrari
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. Fundam. Informaticae 150(1): 119-142 (2017) - [c23]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Proof-Search in Hilbert Calculi. ICTCS/CILC 2017: 301-305 - [c22]Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano:
LOGI: A Didactic Tool for a Beginners' Course in Logic (System Description). ICTCS/CILC 2017: 341-345 - [c21]Camillo Fiorentini
A Forward Unprovability Calculus for Intuitionistic Propositional Logic. TABLEAUX 2017: 114-130 - 2016
- [e1]Camillo Fiorentini, Alberto Momigliano:
Proceedings of the 31st Italian Conference on Computational Logic, Milano, Italy, June 20-22, 2016. CEUR Workshop Proceedings 1645, CEUR-WS.org 2016 [contents] - 2015
- [j16]Alessandro Avellone
A Semantical Analysis of Focusing and Contraction in Intuitionistic Logic. Fundam. Informaticae 140(3-4): 247-262 (2015) - [j15]Camillo Fiorentini
Terminating sequent calculi for proving and refuting formulas in S4. J. Log. Comput. 25(1): 179-205 (2015) - [j14]Mauro Ferrari
An Evaluation-Driven Decision Procedure for G3i. ACM Trans. Comput. Log. 16(1): 8:1-8:37 (2015) - [c20]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Towards a tableau-based procedure for PLTL based on a multi-conclusion rule and logical optimizations. CILC 2015: 117-121 - [c19]Mauro Ferrari
Proof-Search in Natural Deduction Calculus for Classical Propositional Logic. TABLEAUX 2015: 237-252 - 2014
- [c18]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
JTabWb: a Java Framework for Implementing Terminating Sequent and Tableau Calculi. CILC 2014: 46-53 - 2013
- [j13]Mauro Ferrari
Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models. J. Autom. Reason. 51(2): 129-149 (2013) - [c17]Alessandro Avellone, Camillo Fiorentini, Alberto Momigliano:
Focusing on Contraction. CILC 2013: 65-81 - [c16]Mauro Ferrari
A Terminating Evaluation-Driven Variant of G3i. TABLEAUX 2013: 104-118 - 2012
- [j12]Mauro Ferrari
Simplification Rules for Intuitionistic Propositional Tableaux. ACM Trans. Comput. Log. 13(2): 14:1-14:23 (2012) - 2010
- [j11]Mauro Ferrari
BCDL\boldsymbol {\cal BC\!D\!L}: Basic Constructive Description Logic. J. Autom. Reason. 44(4): 371-399 (2010) - [c15]Camillo Fiorentini
A Constructive Approach to Testing Model Transformations. ICMT@TOOLS 2010: 77-92 - [c14]Loris Bozzato
A Decidable Constructive Description Logic. JELIA 2010: 51-63 - [c13]Mauro Ferrari
fCube: An Efficient Prover for Intuitionistic Propositional Logic. LPAR (Yogyakarta) 2010: 294-301
2000 – 2009
- 2009
- [j10]Mauro Ferrari
A tableau calculus for Propositional Intuitionistic Logic with a refined treatment of nested implications. J. Appl. Non Class. Logics 19(2): 149-166 (2009) - [c12]Mario Ornaghi, Camillo Fiorentini
Applying ASP to UML Model Validation. LPNMR 2009: 457-463 - 2008
- [c11]Camillo Fiorentini
Towards a Type Discipline for Answer Set Programming. TYPES 2008: 117-135 - 2007
- [c10]Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
A Constructive Semantics for ALC. Description Logics 2007 - [c9]Mauro Ferrari
Snapshot Generation in a Constructive Object-Oriented Modeling Language. LOPSTR 2007: 169-184 - 2005
- [j9]Mauro Ferrari
On the complexity of the disjunction property in intuitionistic and modal logics. ACM Trans. Comput. Log. 6(3): 519-538 (2005) - [c8]Alessandro Avellone
ESBC: an application for computing stabilization bounds. CLASE 2005: 23-33 - [c7]Mario Ornaghi, Marco Benini, Mauro Ferrari
A Constructive Object Oriented Modeling Language for Information Systems. CLASE 2005: 55-75 - 2004
- [j8]Mauro Ferrari
A secondary semantics for Second Order Intuitionistic Propositional Logic. Math. Log. Q. 50(2): 202-210 (2004) - [c6]Alessandro Avellone
A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation. CSL 2004: 488-502 - 2003
- [j7]Mauro Ferrari
A Proof-theoretical Analysis of Semiconstructive Intermediate Theories. Stud Logica 73(1): 21-49 (2003) - [j6]Camillo Fiorentini
Combining word problems through rewriting in categories with products. Theor. Comput. Sci. 294(1/2): 103-149 (2003) - 2002
- [c5]Mauro Ferrari
On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics. LPAR 2002: 175-189 - [c4]Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
Tableau Calculi for the Logics of Finite k-Ary Trees. TABLEAUX 2002: 115-129 - 2001
- [j5]Mauro Ferrari
Extracting information from intermediate semiconstructive HA-systems - extended abstract. Math. Struct. Comput. Sci. 11(4): 589-596 (2001) - [j4]Camillo Fiorentini:
Hypercanonicity, Extensive Canonicity, Canonicity and Strong Completeness of Intermediate Propositional Logics. Reports Math. Log. 35: 3-46 (2001) - [c3]Mauro Ferrari
Extracting Exact Time Bounds from Logical Proofs. LOPSTR 2001: 245-266 - 2000
- [j3]Camillo Fiorentini:
All Intermediate Logics with Extra Axions in One Variable, Except Eight, Are Not Strongly omega-Complete. J. Symb. Log. 65(4): 1576-1604 (2000) - [c2]Alessandro Avellone, Mauro Ferrari, Camillo Fiorentini:
A formal framework for synthesis and verification of logic programs. LOPSTR 2000 - [c1]Alessandro Avellone
A Formal Framework for Synthesis and Verification of Logic Programs. LOPSTR (LNCS 2042: Selected Papers) 2000: 1-17
1990 – 1999
- 1999
- [j2]Camillo Fiorentini, Pierangelo Miglioli:
A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications. Log. J. IGPL 7(6): 733-753 (1999) - 1996
- [j1]Alessandro Avellone
On maximal intermediate predicate constructive logics. Stud Logica 57(2/3): 373-408 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: