On strengthening the logic of iterated belief revision: proper ordinal interval operators
- Submitting institution
-
Cardiff University / Prifysgol Caerdydd
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 107930389
- Type
- D - Journal article
- DOI
-
10.1016/j.artint.2020.103289
- Title of journal
- Artificial Intelligence
- Article number
- 103289
- First page
- -
- Volume
- 285
- Issue
- -
- ISSN
- 0004-3702
- Open access status
- Compliant
- Month of publication
- May
- Year of publication
- 2020
- URL
-
http://dx.doi.org/10.1016/j.artint.2020.103289
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
A - Artificial intelligence and data analytics
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper introduces a new family of operators for iterated belief revision, that generalises previous approaches. It is the journal version of a paper presented at KR2018 (p210-219), extended to include proofs of all results. The concept of “contraposing conditional sentence” arising from the framework in the paper is being actively studied more closely by philosophers such as Hans Rott (Univ. Regensburg: http://philsci-archive.pitt.edu/17092/). The operators for belief change described in this work are now being implemented in the theorem-proving software Isabelle (https://isabelle.in.tum.de) by Technical University of Denmark (DTU).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -