Francesco A. Genco

Andrea Iacona

J. Philos. Log., February, 2026

A logic for reasoning about (negative) trust under uncertainty.

[BibT_eX]

[DOI]

Francesca Doneda

Giuseppe Primiero

J. Appl. Non Class. Logics, January, 2026

2025

What stands between Grounding Rules and Logical Rules is the Excluded Middle.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2025

Checking trustworthiness of probabilistic computations in a typed natural deduction system.

[BibT_eX]

[DOI]

Fabio Aurelio D'Asaro

Giuseppe Primiero

J. Log. Comput., 2025

Assessing the Risk of Discrimination with BRIO: A Use Case from the Financial Sector.

[BibT_eX]

[DOI]

Alessandro Giuseppe Buda

Proceedings of the 4th International Conference on Hybrid Human-Artificial Intelligence, 2025

2024

Grounding operators: transitivity and trees, logicality and balance.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, October, 2024

A Strongly Normalising System of Dependent Types for Transparent and Opaque Probabilistic Computation.

[BibT_eX]

[DOI]

CoRR, 2024

Evaluating AI fairness in credit scoring with the BRIO tool.

[BibT_eX]

[DOI]

Greta Coraglia

Pellegrino Piantadosi

CoRR, 2024

A Logic of Knowledge and Justifications, with an Application to Computational Trust.

[BibT_eX]

[DOI]

CoRR, 2024

Bias Amplification Chains in ML-based Systems with an Application to Credit Scoring.

[BibT_eX]

[DOI]

Alessandro Giuseppe Buda

Proceedings of the 3rd Workshop on Bias, 2024

2023

A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs.

[BibT_eX]

[DOI]

Giuseppe Primiero

CoRR, 2023

BRIOxAlkemy: a Bias Detecting Tool.

[BibT_eX]

[DOI]

Greta Coraglia

Fabio Aurelio D'Asaro

Francesco Antonio Genco

Proceedings of the 2nd Workshop on Bias, 2023

2021

Grounding, Quantifiers, and Paradoxes.

[BibT_eX]

[DOI]

Francesca Poggiolesi

Lorenzo Rossi

J. Philos. Log., 2021

Formal explanations as logical derivations.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2021

Defining Formal Explanation in Classical Logic by Substructural Derivability.

[BibT_eX]

[DOI]

Francesca Poggiolesi

Proceedings of the Connecting with Computability, 2021

2020

On the concurrent computational content of intermediate logics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Par means parallel: multiplicative linear logic proofs as concurrent functional programs.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2020

A typed parallel lambda-calculus via 1-depth intermediate proofs.

[BibT_eX]

[DOI]

Francesco Antonio Genco

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019

⅋ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs.

[BibT_eX]

[DOI]

CoRR, 2019

A typed parallel $λ$-calculus for graph-based communication.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Hypersequents and Systems of Rules: Embeddings and Applications.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2018

Substructural logics: <i>semantics, proof theory, and applications.</i> report on the second SYSMICS workshop.

[BibT_eX]

[DOI]

Revantha Ramanayake

ACM SIGLOG News, 2018

Classical Proofs as Parallel Programs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Disjunctive Axioms and Concurrent λ-Calculi: a Curry-Howard Approach.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Mīmā\d{m}sā deontic logic: proof theory and applications.

[BibT_eX]

[DOI]

CoRR, 2017

Gödel logic: From natural deduction to parallel computation.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Curry-Howard Correspondence for Gödel Logic: from Natural Deduction to Parallel Computation.

[BibT_eX]

[DOI]

CoRR, 2016

Embedding formalisms: hypersequents and two-level systems of rule.

[BibT_eX]

[DOI]