Non-binary quantified CSP: Algorithms and modelling
From MaRDI portal
Publication:1037645
DOI10.1007/s10601-009-9068-1zbMath1186.68441OpenAlexW2063268277MaRDI QIDQ1037645
Publication date: 16 November 2009
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-009-9068-1
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Backjumping for quantified Boolean logic satisfiability
- Stochastic constraint programming: A scenario-based approach
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Solving quantified constraint satisfaction problems
- Solution Directed Backjumping for QCSP
- Repair-Based Methods for Quantified CSPs
- Consistency for Quantified Constraint Satisfaction Problems
- BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
- Principles of Constraint Programming
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Computer Science Logic
- Theory and Applications of Satisfiability Testing
- Recent Advances in Constraints
- Logic for Programming, Artificial Intelligence, and Reasoning
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Non-binary quantified CSP: Algorithms and modelling
