Strong Equivalence for Logic Programs with Preferences
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 430-434.
Abstract
Recently, strong equivalence for Answer Set Programming has been studied intensively, and was shown to be beneficial for modular programming and automated optimization. In this paper we define the novel notion of strong equivalence for logic programs with preferences. Based on this definition we give, for several semantics for preference handling, necessary and sufficient conditions for programs to be strongly equivalent. These results provide a clear picture of the relationship of these semantics with respect to strong equivalence, which differs considerably from their relationship with respect to answer sets. Finally, based on these results, we present for the first time simplification methods for logic programs with preferences.
@inproceedings{ijcai2005p125,
title = {Strong Equivalence for Logic Programs with Preferences},
author = {Faber, Wolfgang and Konczak, Kathrin},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {430--434},
year = {2005},
url = {https://ijcai.org/proceedings/2005/125},
}
TY - CPAPER TI - Strong Equivalence for Logic Programs with Preferences AU - Faber, Wolfgang AU - Konczak, Kathrin T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 430 EP - 434 UR - https://ijcai.org/proceedings/2005/125 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
