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 ...
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,&...
We dene 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...
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...
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, ...