583 search results - page 55 / 117 » Preferences in Answer Set Programming |
104
click to vote
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
118
click to vote
DALT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
135
click to vote
RULEML
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
IJCAI
2003
15 years 2 months ago
2003
Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. CP-nets were designed to make the preference elicitation proces...
115
click to vote
SLP
1994
15 years 2 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...