Sciweavers

175 search results - page 5 / 35
» Generalizing stable semantics by preferences
Sort
View
AAAI
2006
13 years 9 months ago
Preference Elicitation and Generalized Additive Utility
Any automated decision support software must tailor its actions or recommendations to the preferences of different users. Thus it requires some representation of user preferences ...
Darius Braziunas, Craig Boutilier
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
13 years 9 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
DEDUCTIVE
1996
105views Database» more  DEDUCTIVE 1996»
13 years 8 months ago
Stable Semantics of Temporal Deductive Databases
We de ne a preferential semantics based on stable generated models for a very general class of temporal deductive databases. We allow two kinds of temporal information to be repre...
Heinrich Herre, Gerd Wagner
AI
2005
Springer
13 years 7 months ago
SCC-recursiveness: a general schema for argumentation semantics
entation theory, Dung's abstract framework provides a unifying view of several alternative semantics based on the notion of extension. In this context, we propose a general r...
Pietro Baroni, Massimiliano Giacomin, Giovanni Gui...
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 7 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...