Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Genco, Francesco A."'
Autor:
Genco, Francesco A.
We define an extension of lambda-calculus with dependents types that enables us to encode transparent and opaque probabilistic programs and prove a strong normalisation result for it by a reducibility technique. While transparent non-deterministic pr
Externí odkaz:
http://arxiv.org/abs/2406.17082
Autor:
Coraglia, Greta, Genco, Francesco A., Piantadosi, Pellegrino, Bagli, Enrico, Giuffrida, Pietro, Posillipo, Davide, Primiero, Giuseppe
We present a method for quantitative, in-depth analyses of fairness issues in AI systems with an application to credit scoring. To this aim we use BRIO, a tool for the evaluation of AI systems with respect to social unfairness and, more in general, e
Externí odkaz:
http://arxiv.org/abs/2406.03292
Autor:
Genco, Francesco A.
We present a logical framework that enables us to define a formal theory of computational trust in which this notion is analysed in terms of epistemic attitudes towards the possible objects of trust and in relation to existing evidence in favour of t
Externí odkaz:
http://arxiv.org/abs/2405.15647
Autor:
Genco, Francesco A.
We formally investigate immediate and mediate grounding operators from an inferential perspective. We discuss the differences in behaviour displayed by several grounding operators and consider a general distinction between grounding and logical opera
Externí odkaz:
http://arxiv.org/abs/2304.02596
The extensive deployment of probabilistic algorithms has radically changed our perspective on several well-established computational notions. Correctness is probably the most basic one. While a typical probabilistic program cannot be said to compute
Externí odkaz:
http://arxiv.org/abs/2302.00958
In this paper we present the probabilistic typed natural deduction calculus TPTND, designed to reason about and derive trustworthiness properties of probabilistic computational processes, like those underlying current AI applications. Derivability in
Externí odkaz:
http://arxiv.org/abs/2206.12934
Along the lines of the Abramsky ``Proofs-as-Processes'' program, we present an interpretation of multiplicative linear logic as typing system for concurrent functional programming. In particular, we study a linear multiple-conclusion natural deductio
Externí odkaz:
http://arxiv.org/abs/1907.03631
We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The resulting calcul
Externí odkaz:
http://arxiv.org/abs/1902.03882
Publikováno v:
EPTCS 277, 2018, pp. 43-57
We introduce a first proofs-as-parallel-programs correspondence for classical logic. We define a parallel and more powerful extension of the simply typed lambda calculus corresponding to an analytic natural deduction based on the excluded middle law.
Externí odkaz:
http://arxiv.org/abs/1809.03094
Autor:
Ciabattoni, Agata, Genco, Francesco A.
Publikováno v:
ACM Transactions on Computational Logic (TOCL). Volume 19, Issue 2, Article No. 11. 2018
We define a bi-directional embedding between hypersequent calculi and a subclass of systems of rules (2-systems). In addition to showing that the two proof frameworks have the same expressive power, the embedding allows for the recovery of the benefi
Externí odkaz:
http://arxiv.org/abs/1805.04852