Strong Equivalence for Logic Programs with Preferences
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. 1
Cite
Text
Faber and Konczak. "Strong Equivalence for Logic Programs with Preferences." International Joint Conference on Artificial Intelligence, 2005.Markdown
[Faber and Konczak. "Strong Equivalence for Logic Programs with Preferences." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/faber2005ijcai-strong/)BibTeX
@inproceedings{faber2005ijcai-strong,
title = {{Strong Equivalence for Logic Programs with Preferences}},
author = {Faber, Wolfgang and Konczak, Kathrin},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {430-435},
url = {https://mlanthology.org/ijcai/2005/faber2005ijcai-strong/}
}