Solving quantified constraint satisfaction problems

DOI10.1016/j.artint.2007.11.003zbMath1182.68241OpenAlexW2046194288MaRDI QIDQ2389634

Andrew Rowley, Kostas Stergiou, Ian Philip Gent, Peter W. Nightingale

Publication date: 17 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2007.11.003

zbMATH Keywords

search algorithmsrandom problemsquantified Boolean formulasarc consistencyquantified constraint satisfaction problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

General game playing with stochastic CSP ⋮ Unnamed Item ⋮ Constraint programming approach to a bilevel scheduling problem ⋮ Quantified Constraints in Twenty Seventeen ⋮ Non-binary quantified CSP: Algorithms and modelling

Uses Software

• Quantor
• sKizzo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Backjumping for quantified Boolean logic satisfiability
• Local and global relational consistency
• An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
• An optimal coarse-grained arc consistency algorithm
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
• Reusing CSP Propagators for QCSPs
• Efficient solving of quantified inequality constraints over the real numbers
• Computer Science Logic
• Theory and Applications of Satisfiability Testing
• Automated Deduction – CADE-20
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Logic for Programming, Artificial Intelligence, and Reasoning
• Theory and Applications of Satisfiability Testing

This page was built for publication: Solving quantified constraint satisfaction problems