175 search results - page 6 / 35 » Generalizing stable semantics by preferences |
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
FC
2006
Springer
13 years 11 months ago
2006
Springer
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
LANMR
2007
13 years 9 months ago
2007
Given a propositional formula X, we present a mapping that constructs a general program P, such that the maximal models of X correspond to the stable models of P, after intersectin...
LPNMR
2004
Springer
14 years 25 days ago
2004
Springer
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
COMMA
2008
13 years 9 months ago
2008
Abstract. This paper is concerned with the general problem of constructing decision tables and more specifically, with the identification of all possible outcomes of decisions. We ...