Dear all,
We will have our next LIRa session tomorrow, on Thursday, 4 November 16:30.
Please use our recurring zoom link:
https://uva-live.zoom.us/j/88142993494?pwd=d1BsQWR4T2UyK0Job29YNThjaGRkUT09
(Meeting ID: 881 4299 3494, Passcode: 352984)
You can find the details of the talk below.
Speaker: Giuseppe Primiero
Date and Time: Thursday, November 4th 2021, 16:30-18:00,
Amsterdam time.
Venue: online.
Title: A Typed Natural Deduction System to verify Trustworthiness of
Probabilistic Computations (joint work with Fabio Aurelio D'Asaro)
Abstract.
We present TPTND, a typed natural deduction calculus to verify
trustworthiness of probabilistic programs as a safety property. To set
the stage, we provide a simple case-study in a machine-learning
setting to illustrate the need for such a system and its foreseeable
use. For the formal presentation, we start with constructing
distributions of aleatoric variables through formation rules, provide
typing rules for deterministic programs under such distributions, and
generalize to sampling under multiple instances of such programs to
evaluate output frequency. We then formulate introduction and
elimination rules for an operator to verify the trustworthiness of a
program as an evaluation of its possibly unknown or opaque
distribution against its fair and transparent counterpart. To
conclude, we illustrate how standard meta-theoretical results of
output preservation and progress for this calculus are interpreted to
formulate a safety property.
Hope to see you there!
The LIRa team
Dear all,
We will have our next LIRa session on Thursday, 4 November 16:30.
Please use our recurring zoom link:
https://uva-live.zoom.us/j/88142993494?pwd=d1BsQWR4T2UyK0Job29YNThjaGRkUT09
(Meeting ID: 881 4299 3494, Passcode: 352984)
You can find the details of the talk below.
Speaker: Giuseppe Primiero
Date and Time: Thursday, November 4th 2021, 16:30-18:00, Amsterdam time.
Venue: online.
Title: A Typed Natural Deduction System to verify Trustworthiness of
Probabilistic Computations (joint work with Fabio Aurelio D'Asaro)
Abstract.
We present TPTND, a typed natural deduction calculus to verify
trustworthiness of probabilistic programs as a safety property. To set
the stage, we provide a simple case-study in a machine-learning
setting to illustrate the need for such a system and its foreseeable
use. For the formal presentation, we start with constructing
distributions of aleatoric variables through formation rules, provide
typing rules for deterministic programs under such distributions, and
generalize to sampling under multiple instances of such programs to
evaluate output frequency. We then formulate introduction and
elimination rules for an operator to verify the trustworthiness of a
program as an evaluation of its possibly unknown or opaque
distribution against its fair and transparent counterpart. To
conclude, we illustrate how standard meta-theoretical results of
output preservation and progress for this calculus are interpreted to
formulate a safety property.
Hope to see you there!
The LIRa team
Dear all,
We will have our next LIRa session tomorrow, on Thursday, 28 October 16:30.
Please use our recurring zoom link:
https://uva-live.zoom.us/j/88142993494?pwd=d1BsQWR4T2UyK0Job29YNThjaGRkUT09
(Meeting ID: 881 4299 3494, Passcode: 352984)
You can find the details of the talk below.
Speaker: Matías Osta Vélez (Ruhr-University Bochum)
Date and Time: Thursday, October 28th 2021, 16:30-18:00,
Amsterdam time.
Venue: online.
Title: Nonmonotonic reasoning, expectation orderings, and conceptual spaces.
Abstract.
Gärdenfors and Makinson (1994) showed that it is possible to model
non-monotonic inference by means of a classical consequence relation
together with an ordering of formulas representing our expectations
about the world. However, an important limitation of their approach is
that it does not explain the cognitive origins and structure of these
expectations. This talk aims to offer a solution to this problem using
the theory of conceptual spaces. The central claim is that our
expectations about the world depend, to a significant extent, on the
prototypical structure of our categories. Building on this idea and
focusing on how we reason about properties and objects, we advance a
typicality measure based on the metric structure of conceptual spaces.
We then show how this measure generates an ordered set of expectations
that can be used as default rules with variable strength in
non-monotonic inference. Finally, we discuss various ways in which
these sets are updated in the light of new information and we present
an application of this model to the conjunction fallacy.
Hope to see you there!
The LIRa team
Dear all,
We will have our next LIRa session on Thursday, 28 October 16:30.
Please use our recurring zoom link:
https://uva-live.zoom.us/j/88142993494?pwd=d1BsQWR4T2UyK0Job29YNThjaGRkUT09
(Meeting ID: 881 4299 3494, Passcode: 352984)
You can find the details of the talk below.
Speaker: Matías Osta Vélez (Ruhr-University Bochum)
Date and Time: Thursday, October 28th 2021, 16:30-18:00,
Amsterdam time.
Venue: online.
Title: Nonmonotonic reasoning, expectation orderings, and conceptual
spaces
Abstract.
Gärdenfors and Makinson (1994) showed that it is possible to model
non-monotonic inference by means of a classical consequence relation
together with an ordering of formulas representing our expectations
about the world. However, an important limitation of their approach is
that it does not explain the cognitive origins and structure of these
expectations. This talk aims to offer a solution to this problem using
the theory of conceptual spaces. The central claim is that our
expectations about the world depend, to a significant extent, on the
prototypical structure of our categories. Building on this idea and
focusing on how we reason about properties and objects, we advance a
typicality measure based on the metric structure of conceptual spaces.
We then show how this measure generates an ordered set of expectations
that can be used as default rules with variable strength in
non-monotonic inference. Finally, we discuss various ways in which
these sets are updated in the light of new information and we present
an application of this model to the conjunction fallacy.
Hope to see you there!
The LIRa team
Dear all,
We will have our next LIRa session tomorrow, on Thursday, 21 October 16:30.
Please use our recurring zoom link:
https://uva-live.zoom.us/j/88142993494?pwd=d1BsQWR4T2UyK0Job29YNThjaGRkUT09
(Meeting ID: 881 4299 3494, Passcode: 352984)
You can find the details of the talk below.
Speaker: Francesca Poggiolesi
Date and Time: Thursday, October 21st 2021, 16:30-18:00,
Amsterdam time.
Venue: online.
Title: Grounding principles for (relevant) implication
Abstract.
Most of the logics of grounding that have so far been proposed contain
grounding axioms, or grounding rules, for the connectives of
conjunction, disjunction and negation, but little attention has been
dedicated to the implication connective. The present talk aims at
repairing this situation by proposing adequate grounding principles
for (relevant) implication. Such a goal is reached by adopting a novel
neo-Bolzanian conception of grounding, which is far from the
metaphysical context of contemporary literature. Because of the
interaction between negation and implication, new grounding principles
concerning negation will also arise.
Hope to see you there!
The LIRa team
Dear all,
We will have our next LIRa session on Thursday, 21 October 16:30.
Please use our recurring zoom link:
https://uva-live.zoom.us/j/88142993494?pwd=d1BsQWR4T2UyK0Job29YNThjaGRkUT09
(Meeting ID: 881 4299 3494, Passcode: 352984)
You can find the details of the talk below.
Speaker: Francesca Poggiolesi
Date and Time: Thursday, October 21st 2021, 16:30-18:00,
Amsterdam time.
Venue: online.
Title: Grounding principles for (relevant) implication
Abstract.
Most of the logics of grounding that have so far been proposed contain
grounding axioms, or grounding rules, for the connectives of
conjunction, disjunction and negation, but little attention has been
dedicated to the implication connective. The present talk aims at
repairing this situation by proposing adequate grounding principles
for (relevant) implication. Such a goal is reached by adopting a novel
neo-Bolzanian conception of grounding, which is far from the
metaphysical context of contemporary literature. Because of the
interaction between negation and implication, new grounding principles
concerning negation will also arise.
Hope to see you there!
The LIRa team
Dear all,
1.) You might be interested in the opening talk of the DEON seminar, tomorrow at 14:00.
Please find all details at https://icr.uni.lu/deonticlogic/lectureseries.html
2.) We will have our next LIRa session tomorrow, on Thursday, 14 October 16:30.
Please use our recurring zoom link:
https://uva-live.zoom.us/j/88142993494?pwd=d1BsQWR4T2UyK0Job29YNThjaGRkUT09
(Meeting ID: 881 4299 3494, Passcode: 352984)
You can find the details of the talk below.
Speaker: Jürgen Landes
Date and Time: Thursday, October 14th 2021, 16:30-18:00,
Amsterdam time.
Venue: online.
Title: Entropy Maximisation on Predicate Languages
Abstract. The Maximum Entropy Principle is straight-forward and
well-understood on finite domains due to the seminal work of Alena
Vencovská & Jeff Paris. In this talk, I consider applications of
the Maximum Entropy Principle to infinite predicate languages. After
introducing two conceptually different explications, I'll talk about
their conjectured equivalence and provide some evidence for this
conjecture. Finally, I'll show that one of these explications agrees
with Jeffrey updating.
Hope to see you there!
The LIRa team
Dear all,
We will have our next LIRa session on Thursday, 14 October 16:30.
Please use our recurring zoom link:
https://uva-live.zoom.us/j/88142993494?pwd=d1BsQWR4T2UyK0Job29YNThjaGRkUT09
(Meeting ID: 881 4299 3494, Passcode: 352984)
You can find the details of the talk below.
Speaker: Jürgen Landes
Date and Time: Thursday, October 14th 2021, 16:30-18:00,
Amsterdam time.
Venue: online.
Title: Entropy Maximisation on Predicate Languages
Abstract. Abstract: The Maximum Entropy Principle is straight-forward
and well-understood on finite domains due to the seminal work of Alena
Vencovská & Jeff Paris. In this talk, I consider applications of
the Maximum Entropy Principle to infinite predicate languages. After
introducing two conceptually different explications, I'll talk about
their conjectured equivalence and provide some evidence for this
conjecture. Finally, I'll show that one of these explications agrees
with Jeffrey updating.
Hope to see you there!
The LIRa team
Dear all,
The following event might be interesting to the LIRa audience:
-----------------------------
DEON Seminar Series – opening talk by Marek Sergot
2021 is a special year for Deontic Logic. It is the 70th anniversary of the first publication in modern deontic logic: von Wright’s ground breaking and still inspiring article from 1951. It is also the 30th anniversary of the first DEON conference held in Amsterdam in 1991. Today, deontic logic is a fast-growing field whose research agenda covers topics at the interface between computer science, linguistics, philosophy, ethics, the social sciences, and law. Among many other topics, it includes the formal study of normative multi-agent systems, of defeasible normative reasoning, of the semantics and pragmatics of normative expressions in natural language, the formal representation of rights, authorization, delegation, power, and responsibility, and the study of normative aspects of protocols for communication, negotiation and multi-agent decision making.
As representatives of the DEON community, we want to take Deontic Logic’s 70th anniversary as an opportunity to look back at its rich history and draw lessons for the future. As a formal approach to normativity and reasoning, we believe deontic logic can play new roles as a guiding theory in some of the problems in modern AI, philosophy, law and linguistics.
To investigate the role of deontic logic in the modern age further, we decided to launch an online seminar series where old ideas are explained, new ideas are explored and modern connections and applications are reflected upon. The seminars are not intended as an alternative to the biannual DEON conferences, but are complementary opportunities to keep in touch with the community and listen in or contribute to presentations and informal discussions on ongoing work. Four times per year (once every season), we will virtually gather to discuss a topic or a paper, or to listen to someone’s new results or opinions. Everyone who is interested in this wonderful area and its questions is welcome.
The series-opening talk – celebrating all the anniversaries – will be given by Marek Sergot (Professor of Computational Logic, Imperial College London).
What is deontic logic for?
Marek Sergot
This will be a review of issues in the development of deontic logic, understood both narrowly, as the logic of obligation and permission, and more broadly as the formalisation of normative systems. The talk will be based on examples. I want to look at how they might be treated in the light of developments that have taken place over the thirty years since the first of the DEON series was held in Amsterdam in 1991. I considered calling the talk ‘Some things I have said about deontic logic that no-one paid attention to’. However, I will include things that others have said about deontic logic too. Deontic logic is a wide field; I will have to be selective about what issues are covered.
Date and time: October 14, 2pm – 3:30pm CET
Zoom link: https://uva-live.zoom.us/j/89287004976 (Meeting ID: 892 8700 4976)
Virtual gathering: join us for a virtual gathering on wonder.me after the talk! No registration needed, just follow this link: https://www.wonder.me/r?id=3536c0e5-c486-4ff2-876a-91e569f4190b.
If you are interested in the upcoming events in this series, subscribe here:
https://icr.uni.lu/deonticlogic/mailinglist.html
See you on the 14th of October,
Ilaria Canavotto, Huimin Dong, and Réka Markovich
DEON Seminar Series organizers
----------------------------
The LIRa team
Dear all,
Our speaker for today, Dingmar van Eck, has unfortunately fallen ill. The session is cancelled. We will try to reschedule it for some time in the future. We will keep you posted.
The LIRa team