Dealing with Incomplete Preferences in Soft Constraint Problems

DOI10.1007/978-3-540-74970-7_22zbMath1145.68513OpenAlexW1760227883MaRDI QIDQ3523064

Mirco Gelain, Francesca Rossi, Maria Silvia Pini, Kristen Brent Venable

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_22

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Interleaving solving and elicitation of constraint satisfaction problems based on expected cost ⋮ Interval-valued soft constraint problems ⋮ Semiring-Based Soft Constraints ⋮ On the modelling and optimization of preferences in constraint-based temporal reasoning ⋮ Reaching a joint decision with minimal elicitation of voter preferences ⋮ Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies ⋮ Robust Solutions in Unstable Optimization Problems

Cites Work

• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Open constraint programming
• Semiring-based constraint satisfaction and optimization
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Dealing with Incomplete Preferences in Soft Constraint Problems