Compiling constraint satisfaction problems
From MaRDI portal
Publication:1606322
DOI10.1016/S0004-3702(99)00077-6zbMath0996.68185OpenAlexW1998893408MaRDI QIDQ1606322
Publication date: 24 July 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00077-6
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Hierarchical fault diagnosis for discrete-event systems under global consistency ⋮ Interchangeability with thresholds and degradation factors for soft CSPs ⋮ Learning cluster-based structure to solve constraint satisfaction problems ⋮ Consistency restoration and explanations in dynamic CSPs---Application to configuration
Cites Work
- Unnamed Item
- Unnamed Item
- Network-based heuristics for constraint-satisfaction problems
- Tree clustering for constraint networks
- Decomposing constraint satisfaction problems using database techniques
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- Refining the phase transition in combinatorial search
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- `` Strong NP-Completeness Results
- Synthesizing constraint expressions
This page was built for publication: Compiling constraint satisfaction problems
