Report on STSM of Ronen Brafman to U. of Padova.
Host: Francesca Rossi

During the week of 30/3-3/4 I was hosted at the U. of Padova by Prof.
Francesca Rossi.
During my stay we worked on a joint research, I gave a talk, and we worked
on a new research proposal.
The research work focused on efficient algorithms for finding top-k elements
according to CP-nets and constrained CP-nets.
We were able to come up with an efficient (low-order polynomial time)
algorithm for generating the next most preferred feasible solution given any
current solution. In addition, we worked on a joint research proposal to be
submitted for funding to the ICT-FET program. Finally, I gave a talk on
generic preference specification formalisms.