Interleaving solving and elicitation of constraint satisfaction problems based on expected cost

DOI10.1007/s10601-010-9099-7zbMath1208.68208OpenAlexW2082193100MaRDI QIDQ606920

Nic Wilson, Eugene C. Freuder, Diarmuid Grimes

Publication date: 19 November 2010

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-010-9099-7

zbMATH Keywords

constraint elicitationincomplete CSPsinteractive CSPsopen constraintsuncertain constraints

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving weighted CSP by maintaining arc consistency
• Stochastic constraint programming: A scenario-based approach
• Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
• Network-based heuristics for constraint-satisfaction problems
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Open constraint programming
• Dealing with Incomplete Preferences in Soft Constraint Problems
• A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs
• On the Greedy Solution of Ordering Problems
• New methods to color the vertices of a graph
• Principles and Practice of Constraint Programming – CP 2003
• Random constraint satisfaction: Flaws and structure
• Consistency restoration and explanations in dynamic CSPs---Application to configuration

This page was built for publication: Interleaving solving and elicitation of constraint satisfaction problems based on expected cost