Answer sets for prioritized logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Preferred answer sets for extended logic programs
Artificial Intelligence
Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Reasoning with Prioritized Defaults
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Adding Priorities and Specificity to Default Logic
JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Alternating Fixpoint Theory for Logic Programs with Priority
CL '00 Proceedings of the First International Conference on Computational Logic
On the existence of stable models of non-stratified logic programs
Theory and Practice of Logic Programming
A comparative study of logic programs with preference
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
| Hi-index | 0.00 |
Answer Set Programming (ASP), has become a prominent approach for Knowledge Representation and declarative problem solving. ASP has been extended with preferences and several semantics have been proposed. Among the available semantics, the so-called selective semantics have the property of always choosing preferred answer sets from among the standard answer sets, which is a desirable property in many applications. However, there exist programs which while having answer sets, have no preferred answer sets under the existing selective semantics. On the other hand, there are programs which, arguably, have too many preferred answer sets under existing semantics. We propose a new definition of preferred answer sets which is also selective, assigns at most one preferred answer set given a full prioritization of a program, and for negative-cycle-free programs the existence of a preferred answer set is guaranteed as in the case of standard logic programs.