BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs

DOI10.1007/11889205_45MaRDI QIDQ3524264zbMATH OpenOpenAlexFDO

Authors Guillaume Verger, Christian Bessiere

Publication date 9 September 2008

Published in Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-00135534/file/cp06-qcsp.pdf

Mathematics Subject Classification ID

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

Recommendations

• Solving quantified constraint satisfaction problems
• Solution Directed Backjumping for QCSP
• Reusing CSP Propagators for QCSPs
• Repair-Based Methods for Quantified CSPs
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(11)

• Value ordering for quantified CSPs
• Non-binary quantified CSP: Algorithms and modelling
• Solving quantified constraint satisfaction problems
• scientific article; zbMATH DE number 5996844 (Why is no real title available?)
• Solution Directed Backjumping for QCSP
• Repair-Based Methods for Quantified CSPs
• Reusing CSP Propagators for QCSPs
• Quantified constraint handling rules
• Inter-block Backtracking: Exploiting the Structure in Continuous CSPs
• Constraint programming approach to a bilevel scheduling problem
• Quantified constraint handling rules

This page was built for publication: BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524264)