Extending AGM Contraction to Arbitrary Logics
Authors: Zhiqiang Zhuang, Zhe Wang, Kewen Wang, James P Delgrande
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We provide a representation theorem for the contraction which shows that it satisfies all the AGM postulates except for the controversial Recovery Postulate, and is a natural generalisation of entrenchment-based contraction. and Proof sketch: To prove satisfactions of the postulates, again the key is the ability to use disjunctions indirectly. For the other direction, (FC . ct) and (FC . 8) correspond to (EE1) (EE5) as in the AGM case. Also, in Theorem 7, it states: We show this using tableau. |
| Researcher Affiliation | Academia | 1 School of Information and Communication Technology, Griffith University, Australia 2 Institute for Integrated and Intelligent Systems, Griffith University, Australia 3 School of Computing Science, Simon Fraser University, Canada |
| Pseudocode | No | The paper includes definitions and theorems but no structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any statement or link regarding the availability of source code for the described methodology. |
| Open Datasets | No | This paper is theoretical and does not refer to the use of datasets for training. |
| Dataset Splits | No | This paper is theoretical and does not involve dataset validation splits. |
| Hardware Specification | No | The paper is theoretical and does not mention any hardware specifications used for experiments. |
| Software Dependencies | No | The paper is theoretical and does not specify any software dependencies or version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe an experimental setup with hyperparameters or training settings. |