Extending AGM Contraction to Arbitrary Logics
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Special Track on Knowledge Representation and Reasoning. Pages 3299-3306.
Abstract
Classic entrenchment-based contraction is not applicable to many useful logics, such as description logics. This is because the semantic construction refers to arbitrary disjunctions of formulas, while many logics do not fully support disjunction. In this paper, we present a new entrenchment-based contraction which does not rely on any logical connectives except conjunction. This contraction is applicable to all fragments of first-order logic that support conjunction. 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.
@inproceedings{ijcai2015p465,
title = {Extending AGM Contraction to Arbitrary Logics},
author = {Zhuang, Zhi Qiang and Wang, Zhe and Wang, Kewen and Delgrande, James P.},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {3299--3306},
year = {2015},
month = {7},
note = {Special Track on Knowledge Representation and Reasoning},
url = {https://ijcai.org/proceedings/2015/465},
}
TY - CPAPER TI - Extending AGM Contraction to Arbitrary Logics AU - Zhuang, Zhi Qiang AU - Wang, Zhe AU - Wang, Kewen AU - Delgrande, James P. T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 3299 EP - 3306 UR - https://ijcai.org/proceedings/2015/465 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
