Preferred answer sets for extended logic
โ
Gerhard Brewka; Thomas Eiter
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 442 KB
In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used to defi