Weak Order Equivalence for Logic Programs with Preferences.
Kathrin Konczak · 2006
Abstract. Recently, notions of equivalence for Answer Set Programming have been stud-ied intensively and were shown to be benecial for modular programming and automated optimization. In [9], the novel notion of strong equivalence for logic programs with rule preferences (so-called ordered logic programs) has been dened and necessary and sucient conditions for programs being strongly equivalent have been presented. In this paper, we extend this work and analyze a weaker notion of equivalence for ordered logic programs. Whereas strong equivalence makes great demands on ordered logic programs, the weakened notion enables program transformations for simplifying preference relations. 1