Reusing CSP Propagators for QCSPs

DOI10.1007/978-3-540-73817-6_4zbMATH Open1176.68195OpenAlexW1514599026MaRDI QIDQ3608445FDOQ3608445

Jérémie Vautard, Marco H. Benedetti, Arnaud Lallouet

Publication date: 5 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73817-6_4

Recommendations

• Generalizing consistency and other constraint properties to quantified constraints
• Solving quantified constraint satisfaction problems
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• Principles and Practice of Constraint Programming – CP 2004
• Repair-Based Methods for Quantified CSPs

zbMATH Keywords

QCSPquantified languages

Mathematics Subject Classification ID

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

Cited In (5)

• Repair-Based Methods for Quantified CSPs
• Solution Directed Backjumping for QCSP
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• Solving quantified constraint satisfaction problems
• Value ordering for quantified CSPs

Uses Software

• Gecode

This page was built for publication: Reusing CSP Propagators for QCSPs

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