loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Mirco Gelain 1 ; Maria Silvia Pini 1 ; Francesca Rossi 1 ; Kristen Brent Venable 1 and Toby Walsh 2

Affiliations: 1 University of Padova, Italy ; 2 NICTA and UNSW, Australia

Keyword(s): Local search, Preferences, Incompleteness, Elicitation.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Constraint Satisfaction ; Knowledge Representation and Reasoning ; Symbolic Systems

Abstract: We consider fuzzy constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or where there is an ongoing preference elicitation process. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define local search algorithms that interleave search and preference elicitation, with the goal to find a solution which is ”necessarily optimal”, that is, optimal no matter what the missing data are, while asking the user to reveal as few preferences as possible. While in the past this problem has been tackled with a branch & bound approach, which was guaranteed to find a solution with this property, we now want to see whether a local search approach can solve such problems optimally, or obtain a good quality solution, with fewer resources. At each step, our local search algorithm moves from the current solution to a new one, w hich differs in the value of a variable. The variable to reassign and its new value are chosen so to maximize the quality of the next solution. To compute this, we elicit some of the missing preferences in the neighbor solutions. Experimental results on randomly generated fuzzy CSPs with missing preferences show that our local search approach is promising, both in terms of percentage of elicited preferences and scaling properties. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.207.163.25

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Gelain, M.; Pini, M.; Rossi, F.; Brent Venable, K. and Walsh, T. (2011). A LOCAL SEARCH APPROACH TO SOLVE INCOMPLETE FUZZY CSPs. In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-8425-40-9; ISSN 2184-433X, SciTePress, pages 582-585. DOI: 10.5220/0003174505820585

@conference{icaart11,
author={Mirco Gelain. and Maria Silvia Pini. and Francesca Rossi. and Kristen {Brent Venable}. and Toby Walsh.},
title={A LOCAL SEARCH APPROACH TO SOLVE INCOMPLETE FUZZY CSPs},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2011},
pages={582-585},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003174505820585},
isbn={978-989-8425-40-9},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - A LOCAL SEARCH APPROACH TO SOLVE INCOMPLETE FUZZY CSPs
SN - 978-989-8425-40-9
IS - 2184-433X
AU - Gelain, M.
AU - Pini, M.
AU - Rossi, F.
AU - Brent Venable, K.
AU - Walsh, T.
PY - 2011
SP - 582
EP - 585
DO - 10.5220/0003174505820585
PB - SciTePress