Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
From MaRDI portal
Publication:969536
DOI10.1016/j.artint.2009.11.015zbMath1207.68354OpenAlexW1986500599MaRDI QIDQ969536
Francesca Rossi, Toby Walsh, Maria Silvia Pini, Mirco Gelain, Kristen Brent Venable
Publication date: 7 May 2010
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2009.11.015
Related Items (6)
Progress towards the Holy Grail ⋮ Interleaving solving and elicitation of constraint satisfaction problems based on expected cost ⋮ Learning modulo theories for constructive preference elicitation ⋮ Combining local search and elicitation for multi-objective combinatorial optimization ⋮ Balanced stable marriage: how close is close enough? ⋮ Stable multi-skill workforce assignments
Cites Work
- Unnamed Item
- Incompleteness and incomparability in preference aggregation: complexity results
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- Open constraint programming
- Dealing with Incomplete Preferences in Soft Constraint Problems
- A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs
- Semiring-based constraint satisfaction and optimization
- Principles and Practice of Constraint Programming – CP 2003
- Random constraint satisfaction: Flaws and structure
This page was built for publication: Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
