Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
From MaRDI portal
Publication:1332852
DOI10.1016/0004-3702(94)90068-XzbMath0942.68576OpenAlexW2035567824MaRDI QIDQ1332852
Publication date: 14 August 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(94)90068-x
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (12)
On point-duration networks for temporal reasoning ⋮ An optimal backtrack algorithm for tree-structured constraint satisfaction problems ⋮ Metaheuristics: A bibliography ⋮ An empirical study of phase transitions in binary constraint satisfaction problems ⋮ Combining qualitative and quantitative constraints in temporal reasoning ⋮ Multiway spatial joins ⋮ A non-binary constraint ordering heuristic for constraint satisfaction problems ⋮ Constraint satisfaction -- algorithms and complexity analysis ⋮ Backtracking algorithms for disjunctions of temporal constraints ⋮ A Logical Approach to Constraint Satisfaction ⋮ Backjump-based backtracking for constraint satisfaction problems ⋮ Compiling constraint satisfaction problems
Cites Work
- Unnamed Item
- Unnamed Item
- Network-based heuristics for constraint-satisfaction problems
- Tree clustering for constraint networks
- Backtracking with multi-level dynamic search rearrangement
- Consistency in networks of relations
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Networks of constraints: Fundamental properties and applications to picture processing
- A Sufficient Condition for Backtrack-Free Search
- Synthesizing constraint expressions
This page was built for publication: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
