A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs

DOI10.1007/978-3-540-74970-7_47zbMath1145.68532OpenAlexW1857880305MaRDI QIDQ3523081

Nic Wilson, Eugene C. Freuder, Diarmuid Grimes

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_47

Mathematics Subject Classification ID

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

Related Items (4)

Interleaving solving and elicitation of constraint satisfaction problems based on expected cost ⋮ Interval-valued soft constraint problems ⋮ Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies ⋮ Robust Solutions in Unstable Optimization Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Solving weighted CSP by maintaining arc consistency
• Stochastic constraint programming: A scenario-based approach
• Open constraint programming
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs