Situated Conditional Reasoning
- URL: http://arxiv.org/abs/2109.01552v2
- Date: Mon, 17 Apr 2023 16:44:43 GMT
- Title: Situated Conditional Reasoning
- Authors: Giovanni Casini, Thomas Meyer, Ivan Varzinczak
- Abstract summary: We show that situation-based conditionals can be described in terms of a set of postulates.
We then define a form of entailment for situated conditional knowledge bases, which we refer to as minimal closure.
- Score: 10.828616610785524
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Conditionals are useful for modelling, but are not always sufficiently
expressive for capturing information accurately. In this paper we make the case
for a form of conditional that is situation-based. These conditionals are more
expressive than classical conditionals, are general enough to be used in
several application domains, and are able to distinguish, for example, between
expectations and counterfactuals. Formally, they are shown to generalise the
conditional setting in the style of Kraus, Lehmann, and Magidor. We show that
situation-based conditionals can be described in terms of a set of rationality
postulates. We then propose an intuitive semantics for these conditionals, and
present a representation result which shows that our semantic construction
corresponds exactly to the description in terms of postulates. With the
semantics in place, we proceed to define a form of entailment for situated
conditional knowledge bases, which we refer to as minimal closure. It is
reminiscent of and, indeed, inspired by, the version of entailment for
propositional conditional knowledge bases known as rational closure. Finally,
we proceed to show that it is possible to reduce the computation of minimal
closure to a series of propositional entailment and satisfiability checks.
While this is also the case for rational closure, it is somewhat surprising
that the result carries over to minimal closure.
Related papers
- (Quantum) Indifferentiability and Pre-Computation [50.06591179629447]
Indifferentiability is a cryptographic paradigm for analyzing the security of ideal objects.
Despite its strength, indifferentiability is not known to offer security against pre-processing attacks.
We propose a strengthening of indifferentiability which is not only composable but also takes arbitrary pre-computation into account.
arXiv Detail & Related papers (2024-10-22T00:41:47Z) - Probabilistic Conformal Prediction with Approximate Conditional Validity [81.30551968980143]
We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution.
Our method consistently outperforms existing approaches in terms of conditional coverage.
arXiv Detail & Related papers (2024-07-01T20:44:48Z) - A probabilistic analysis of selected notions of iterated conditioning
under coherence [0.0]
We consider de Finetti's notion of conditional as a three-valued object and as a conditional random quantity in the betting framework.
We show that the compound probability theorem and other basic properties are not preserved by these objects.
We observe that all the basic properties are satisfied only by the iterated conditional mainly developed by Gilio and Sanfilippo.
arXiv Detail & Related papers (2023-08-20T18:48:37Z) - Abductive Commonsense Reasoning Exploiting Mutually Exclusive
Explanations [118.0818807474809]
Abductive reasoning aims to find plausible explanations for an event.
Existing approaches for abductive reasoning in natural language processing often rely on manually generated annotations for supervision.
This work proposes an approach for abductive commonsense reasoning that exploits the fact that only a subset of explanations is correct for a given context.
arXiv Detail & Related papers (2023-05-24T01:35:10Z) - $\omega$PAP Spaces: Reasoning Denotationally About Higher-Order,
Recursive Probabilistic and Differentiable Programs [64.25762042361839]
$omega$PAP spaces are spaces for reasoning denotationally about expressive differentiable and probabilistic programming languages.
Our semantics is general enough to assign meanings to most practical probabilistic and differentiable programs.
We establish the almost-everywhere differentiability of probabilistic programs' trace density functions.
arXiv Detail & Related papers (2023-02-21T12:50:05Z) - Certain and Uncertain Inference with Indicative Conditionals [0.3437656066916039]
We develop a trivalent semantics for the truth conditions and the probability of the natural language conditional.
We show systematic correspondences between trivalent and probabilistic representations of inferences in either framework.
The result is a unified account of the semantics and indicative of conditionals that can be fruitfully applied to analyzing the validity of conditional inferences.
arXiv Detail & Related papers (2022-07-17T20:06:00Z) - Reasoning over Logically Interacted Conditions for Question Answering [113.9231035680578]
We study a more challenging task where answers are constrained by a list of conditions that logically interact.
We propose a new model, TReasoner, for this challenging reasoning task.
TReasoner achieves state-of-the-art performance on two benchmark conditional QA datasets.
arXiv Detail & Related papers (2022-05-25T16:41:39Z) - A General Framework for Modelling Conditional Reasoning -- Preliminary
Report [4.340338299803562]
We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems.
This framework covers the most popular kinds of conditional reasoning in logic-based KR.
arXiv Detail & Related papers (2022-02-15T17:33:39Z) - Rationales for Sequential Predictions [117.93025782838123]
Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain.
We consider model explanations though rationales, subsets of context that can explain individual model predictions.
We propose an efficient greedy algorithm to approximate this objective.
arXiv Detail & Related papers (2021-09-14T01:25:15Z) - Probabilistic modelling of rational communication with conditionals [0.0]
We take a probabilistic approach to pragmatic reasoning about conditionals.
We show that our model uniformly explains a number of inferences attested in the literature.
arXiv Detail & Related papers (2021-05-12T08:21:25Z) - Modeling Contrary-to-Duty with CP-nets [19.561116525421316]
Conditional preference nets (CP-nets) are a compact formalism to express and analyse ceteris paribus preferences.
This paper shows how deontic concepts can be captured through conditional preference models.
arXiv Detail & Related papers (2020-03-23T18:23:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.