Extending the Harper Identity to Iterated Belief Change

Authors: Richard Booth, Jake Chandler

IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical In this paper we extend the Harper Identity from single-step change to define iterated contraction in terms of iterated revision. Specifically, just as the Harper Identity provides a recipe for defining the belief set resulting from contracting A in terms of (i) the initial belief set and (ii) the belief set resulting from revision by A, we look at ways to define the plausibility ordering over worlds resulting from contracting A in terms of (iii) the initial plausibility ordering, and (iv) the plausibility ordering resulting from revision by A.
Researcher Affiliation Academia Richard Booth Cardiff University Cardiff, UK boothr2@cardiff.ac.uk Jake Chandler La Trobe University Melbourne, Australia jacob.chandler@latrobe.edu.au
Pseudocode No The paper describes definitions and proofs in narrative text and formal notation, but does not include any distinct pseudocode blocks or algorithms labeled as such.
Open Source Code No The paper provides a link for 'full proofs' (http://arxiv.org/abs/1604.05419), which refers to additional content for the paper itself, not open-source code for the described methodology.
Open Datasets No This is a theoretical paper and does not involve the use of datasets for training or evaluation.
Dataset Splits No This is a theoretical paper and does not involve dataset splits for validation.
Hardware Specification No The paper is theoretical and does not describe any computational experiments or specify hardware used.
Software Dependencies No The paper is theoretical and does not specify any software dependencies with version numbers.
Experiment Setup No The paper is theoretical and does not describe any experimental setups, hyperparameters, or training configurations.