The following pages link to (Q2717789):
Displayed 18 items.
- Strong local consistency algorithms for table constraints (Q272003) (← links)
- Computing and restoring global inverse consistency in interactive constraint satisfaction (Q334804) (← links)
- New algorithms for max restricted path consistency (Q429801) (← links)
- Random constraint satisfaction: easy generation of hard (satisfiable) instances (Q1028939) (← links)
- Local consistency for extended CSPs (Q1035707) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- Binary vs. non-binary constraints (Q1614859) (← links)
- Revisiting restricted path consistency (Q1699521) (← links)
- On a new extension of BTP for binary CSPs (Q2331096) (← links)
- Neighborhood singleton consistencies (Q2331105) (← links)
- Partition search for non-binary constraint satisfaction (Q2372239) (← links)
- Theoretical analysis of singleton arc consistency and its extensions (Q2389615) (← links)
- Domain filtering consistencies for non-binary constraints (Q2389637) (← links)
- Efficient algorithms for singleton arc consistency (Q2430358) (← links)
- A constraint-based approach for annotating music scores with gestural information (Q2460252) (← links)
- Path Consistency by Dual Consistency (Q3523072) (← links)
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance (Q3523073) (← links)
- Constraint-Level Advice for Shaving (Q5504686) (← links)