A theoretical evaluation of selected backtracking algorithms.
From MaRDI portal
Publication:1399134
DOI10.1016/S0004-3702(96)00027-6zbMath1042.68671OpenAlexW2064540888MaRDI QIDQ1399134
Grzegorz Kondrak, Peter J. L. van Beek
Publication date: 30 July 2003
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(96)00027-6
Related Items
Binary vs. non-binary constraints ⋮ On point-duration networks for temporal reasoning ⋮ Asynchronous forward-checking for DisCSPs ⋮ The fixed point property for ordered sets ⋮ A theoretical evaluation of selected backtracking algorithms. ⋮ Multiway spatial joins ⋮ Hybrid search for minimal perturbation in dynamic CSPs ⋮ A survey of constraint-based programming paradigms ⋮ Concurrent search for distributed CSPs ⋮ A semantic approach for web reasoning ⋮ Constraint satisfaction methods for solving the staff transfer problem ⋮ Making assumptions in the automated derivation ⋮ The automorphism conjecture for small sets and series parallel sets ⋮ Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard ⋮ A hybrid method for modeling and solving supply chain optimization problems with soft and logical constraints ⋮ Backjumping is Exception Handling ⋮ On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning ⋮ Backtracking algorithms for disjunctions of temporal constraints ⋮ Search algorithms in type theory ⋮ On the relations between SAT and CSP enumerative algorithms ⋮ Decomposable constraints ⋮ On forward checking for non-binary constraint satisfaction. ⋮ Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem ⋮ Backjump-based backtracking for constraint satisfaction problems ⋮ Backjumping for quantified Boolean logic satisfiability ⋮ Hybrid backtracking bounded by tree-decomposition of constraint networks
Cites Work
