583 search results - page 12 / 117 » Preferences in Answer Set Programming |
WILF
2009
Springer
15 years 4 months ago
2009
Springer
A number of generalizations of answer set programming have been proposed in the literature to deal with vagueness, uncertainty, and partial rule satisfaction. We introduce a unifyi...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
188
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
93
Voted
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
This paper introduces a formalism to describe the needs and preferences of database users. Because of the precise formulation of these concepts, we have found an automatic and ver...