Solution Directed Backjumping for QCSP

DOI10.1007/978-3-540-74970-7_13MaRDI QIDQ3523056zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Backjumping for quantified Boolean logic satisfiability
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• Solving quantified constraint satisfaction problems
• Reusing CSP Propagators for QCSPs
• Repair-Based Methods for Quantified CSPs

Cites work

• Backjumping for quantified Boolean logic satisfiability
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• Convergence testing in term-level bounded model checking
• scientific article; zbMATH DE number 1305704 (Why is no real title available?)
• Principles and Practice of Constraint Programming – CP 2004
• Reusing CSP Propagators for QCSPs

Cited in

(5)

• Value ordering for quantified CSPs
• Non-binary quantified CSP: Algorithms and modelling
• Repair-Based Methods for Quantified CSPs
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• scientific article; zbMATH DE number 1884351 (Why is no real title available?)

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

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