Conditional Inference Under Disjunctive Rationality

Abstract

The question of conditional inference, i.e., of which conditional sentences of the form ``if A then, normally, B'' should follow from a set KB of such sentences, has been one of the classic questions of AI, with several well-known solutions proposed. Perhaps the most notable is the rational closure construction of Lehmann and Magidor, under which the set of inferred conditionals forms a rational consequence relation, i.e., satisfies all the rules of preferential reasoning, *plus* Rational Monotonicity. However, this last named rule is not universally accepted, and other researchers have advocated working within the larger class of *disjunctive* consequence relations, which satisfy the weaker requirement of Disjunctive Rationality. While there are convincing arguments that the rational closure forms the ``simplest'' rational consequence relation extending a given set of conditionals, the question of what is the simplest *disjunctive* consequence relation has not been explored. In this paper, we propose a solution to this question and explore some of its properties.

Cite

Text

Booth and Varzinczak. "Conditional Inference Under Disjunctive Rationality." AAAI Conference on Artificial Intelligence, 2021. doi:10.1609/AAAI.V35I7.16774

Markdown

[Booth and Varzinczak. "Conditional Inference Under Disjunctive Rationality." AAAI Conference on Artificial Intelligence, 2021.](https://mlanthology.org/aaai/2021/booth2021aaai-conditional/) doi:10.1609/AAAI.V35I7.16774

BibTeX

@inproceedings{booth2021aaai-conditional,
  title     = {{Conditional Inference Under Disjunctive Rationality}},
  author    = {Booth, Richard and Varzinczak, Ivan},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2021},
  pages     = {6227-6234},
  doi       = {10.1609/AAAI.V35I7.16774},
  url       = {https://mlanthology.org/aaai/2021/booth2021aaai-conditional/}
}