Notions of strong equivalence for logic programs with ordered disjunction

摘要: Ordered disjunctions have been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics the resulting language is based on answer-set semantics, but comes in different variants, depending particular interpretation preference aggregation associated to ordered disjunction connective. While standard programming question when program be considered equivalent another received increasing attention recent years, this problem has not addressed programs with so far. In paper, we discuss concept strong equivalence setting. We introduce versions and provide model-theoretic characterisations, extending well-known ones between ordinary Furthermore, relationships proposed notions study their computational complexity.