From iterated revision to iterated contraction: extending the Harper Identity
- Submitting institution
-
Cardiff University / Prifysgol Caerdydd
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 101504475
- Type
- D - Journal article
- DOI
-
10.1016/j.artint.2019.103171
- Title of journal
- Artificial Intelligence
- Article number
- 103171
- First page
- -
- Volume
- 277
- Issue
- -
- ISSN
- 0004-3702
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2019
- URL
-
http://dx.doi.org/10.1016/j.artint.2019.103171
- 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 collaboration with the Department of Philosophy at La Trobe University, Melbourne, is the first paper to explore the interdefinability between operators of iterated belief revision and iterated belief contraction. It is the journal version of a conference paper presented at the International Joint Conference on Artificial Intelligence (IJCAI 2016), extended to include proofs of all results. The operators for belief change described in this work are now being implemented in the theorem-proving software Isabelle (https://isabelle.in.tum.de) at the Technical University of Denmark.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -