Domain filtering consistencies for non-binary constraints
From MaRDI portal
(Redirected from Publication:2389637)
Recommendations
Cites work
- A sufficient condition for backtrack-bounded search
- An optimal coarse-grained arc consistency algorithm
- Binary vs. non-binary constraints
- Consistency in networks of relations
- Domain filtering consistencies
- Handbook of constraint programming.
- scientific article; zbMATH DE number 2084704 (Why is no real title available?)
- Local and global relational consistency
- On forward checking for non-binary constraint satisfaction.
- On the complexity of join dependencies
- On the minimality and global consistency of row-convex constraint networks
- Principles of Constraint Programming
Cited in
(9)- Decomposable constraints
- Domain reduction techniques for global NLP and MINLP optimization
- Revisiting restricted path consistency
- Neighborhood singleton consistencies
- Domain filtering consistencies
- Strong local consistency algorithms for table constraints
- Intermediary local consistencies
- Constraint-Level Advice for Shaving
- A hybrid tractable class for non-binary CSPs
This page was built for publication: Domain filtering consistencies for non-binary constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389637)