mlsanityData to 14 Oct 2026

Situated Conditional Reasoning

arXiv 2109.01552 ↗First posted 3 Sep 2021cs.AI cs.LOcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 2 of its 56 references that are in the map. First posted on arXiv 3 Sep 2021.

Builds on

2 of 56 references.

References · 2

  1. 2018On Rational Entailment for Propositional Typicality Logiccited by 7
  2. 2018Reasoning about multiple aspects in DLs: Semantics and Closure Constructioncited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.

2 papers.