583 search results - page 74 / 117 » Preferences in Answer Set Programming |
197
click to vote
POPL
2008
ACM
16 years 1 months ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
136
click to vote
LPNMR
1993
Springer
15 years 5 months ago
1993
Springer
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
155
click to vote
FROCOS
2009
Springer
15 years 8 months ago
2009
Springer
The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative k...
104
click to vote
ECIR
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. The following paper proposes a new kind of relevance feedback. It shows how so called query profiles can be employed for disambiguation and clarification. Query profiles ...
105
click to vote
CP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...