Notions of Strong Equivalence for Logic Programs With Ordered Disjunction

Download Now Free registration required

Executive Summary

Ordered disjunctions have been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answer-set semantics, but comes in different variants, depending on the particular interpretation of preference aggregation associated to the ordered disjunction connective. While in standard answer-set programming the question of when a program is to be considered equivalent to another received increasing attention in recent years, this problem has not been addressed for programs with ordered disjunctions so far. In this paper, the authors discuss the concept of strong equivalence in this setting.

  • Format: PDF
  • Size: 189.3 KB