[Back]

W. Faber, H. Tompits, S. Woltran:
"Notions of Strong Equivalence for Logic Programs with Ordered Disjunction";
Talk: Principles of Knowledge Representation and Reasoning (KR), Sydney, Australien; 2008-09-16 - 2008-09-19; in: "Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR'08)", G. Brewka, J. Lang (ed.); AAAI Press, (2008), ISBN: 978-1-57735-384-3; 433 - 443.

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, we discuss the concept of
strong equivalence in this setting. We introduce different versions
of strong equivalence for programs with ordered disjunctions
and provide model-theoretic characterisations, extending
well-known ones for strong equivalence between ordinary
logic programs. Furthermore, we discuss the relationships
between the proposed notions and study their computational
complexity.

http://publik.tuwien.ac.at/files/PubDat_171510.pdf

Project Head Hans Tompits:
Formale Methoden zur Optimierung Nichtmonotoner Logikprogramme