BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs

DOI10.1007/11889205_45zbMath1160.68570OpenAlexW2231782988MaRDI QIDQ3524264

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)

Related Items (6)

Solving quantified constraint satisfaction problems ⋮ Solution Directed Backjumping for QCSP ⋮ Unnamed Item ⋮ Constraint programming approach to a bilevel scheduling problem ⋮ Value ordering for quantified CSPs ⋮ Non-binary quantified CSP: Algorithms and modelling

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