Solution Directed Backjumping for QCSP

DOI10.1007/978-3-540-74970-7_13zbMath1145.68503OpenAlexW1516582734MaRDI QIDQ3523056

Fahiem Bacchus, Kostas Stergiou

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_13

Mathematics Subject Classification ID

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

Related Items (1)

Non-binary quantified CSP: Algorithms and modelling

Cites Work

• Unnamed Item
• Backjumping for quantified Boolean logic satisfiability
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• Reusing CSP Propagators for QCSPs
• Correct Hardware Design and Verification Methods
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Solution Directed Backjumping for QCSP