Preferred answer sets for extended logic programs
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
A semantic framework for preference handling in answer set programming
Theory and Practice of Logic Programming
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
A framework for compiling preferences in logic programs
Theory and Practice of Logic Programming
Complexity results for checking equivalence of stratified logic programs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Possibilistic semantics for logic programs with ordered disjunction
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
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.