Value ordering for quantified CSPs

DOI10.1007/s10601-008-9052-1zbMath1191.68642OpenAlexW2098817723MaRDI QIDQ1020498

David Stynes, Kenneth N. Brown

Publication date: 29 May 2009

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-008-9052-1

zbMATH Keywords

backtracking searchquantified CSPsvalue ordering

Mathematics Subject Classification ID

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

Related Items (1)

A complexity perspective on entailment of parameterized linear constraints

Cites Work

• Unnamed Item
• Backjumping for quantified Boolean logic satisfiability
• The impact of search heuristics on heavy-tailed behaviour
• Identifying and exploiting problem structures using explanation-based constraint programming
• An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
• Consistency for Quantified Constraint Satisfaction Problems
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• Reusing CSP Propagators for QCSPs
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Value ordering for quantified CSPs