TITLE: Dealing with Incomplete Preferences in Soft Constraint Problems

PRESENTER: Francesca Rossi, http://www.math.unipd.it/~frossi/, frossi@math.unipd.it

AFFILIATION:Department of Pure and Applied Mathematics, University of Padova, Italy, http://www.math.unipd.it/

DATE: Friday 17th August 2007

TIME: 12:00:00

PLACE: CSE Seminar Room, Level 1, K17

ABSTRACT:

We consider soft constraint problems where some of the preferences
may be unspecified. This models, for example, situations with several
agents providing the data, or with possible privacy issues. In this
context, we study how to find an optimal solution without having to wait
for all the preferences. In particular, we define an algorithm to find a
solution which is necessarily optimal, that is, optimal no matter what
the missing data will be, with the aim to ask the user to reveal as
few preferences as possible. Experimental results show that in many cases
a necessarily optimal solution can be found by eliciting a small number
of preferences.

BIOGRAPHY OF SPEAKER:

Francesca Rossi is a Professor at University of Padova, Italy. Her main
research interests include constraint solving, constraint programming,
logic programming, concurrency, semantics of programming languages,
Petri nets, graphs and graph grammars. Prof Rossi has hold many
editorial positions, given invited talks, organized and been
committees for many conferences, including AAAI, IJCAI.

Seminar information is also available at http://www.cse.unsw.edu.au/db/ai/seminars/list/index.html

Host:

Toby Walsh

Seminar Convenor:

Van Hai Ho