The following pages link to (Q2717783):
Displayed 13 items.
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
- Efficient solution techniques for disjunctive temporal reasoning problems (Q814524) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
- Enhancing DLV instantiator by backjumping techniques (Q2426106) (← links)
- Multistage robust discrete optimization via quantified integer programming (Q2669532) (← links)
- Large-scale periodic scheduling in time-sensitive networks (Q2669618) (← links)
- A Flexible Search Framework for CHR (Q3616878) (← links)
- Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem (Q3627679) (← links)
- Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
- Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard (Q5958710) (← links)