Sciweavers

Share
CORR
2002
Springer

Logic Programming with Ordered Disjunction

8 years 10 months ago
Logic Programming with Ordered Disjunction
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunction was developed to express totally ordered preferences for alternatives in rule heads. In this paper we introduce an extension of this approach called Disjunctive Logic Programs with Ordered Disjunction (DLPOD) that combines ordered disjunction with common disjunction in rule heads. By this extension, we enhance the preference notions expressible with totally ordered disjunctions to partially ordered preferences. Furthermore, we show that computing optimal stable models for DLPODs still stays in p 2 for head-cycle free programs and establish p 3 upper bounds for the general case.
Gerhard Brewka
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where CORR
Authors Gerhard Brewka
Comments (0)
books