Conditional Inference under disjunctive rationality

Booth, Richard ORCID: https://orcid.org/0000-0002-6647-6381 and Varzinczak, Ivan 2021. Conditional Inference under disjunctive rationality. Presented at: 35th AAAI Conference on Artificial Intelligence, Virtual, 2-9 February, 2021.

Preview

PDF - Accepted Post-Print Version Download (243kB) | Preview

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.

Item Type:	Conference or Workshop Item (Paper)
Status:	In Press
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date of First Compliant Deposit:	9 March 2021
Date of Acceptance:	13 December 2020
Last Modified:	09 Nov 2022 10:24
URI:	https://orca.cardiff.ac.uk/id/eprint/139352

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item