The following pages link to (Q4288820):
Displayed 12 items.
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- Local consistency for extended CSPs (Q1035707) (← links)
- Dynamic graph models (Q1368531) (← links)
- The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)
- From local to global consistency in temporal constraint networks (Q1391930) (← links)
- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic (Q1391939) (← links)
- Constraint-generating dependencies (Q1807678) (← links)
- The essence of constraint propagation (Q1960525) (← links)
- Probabilistic argumentation (Q2390652) (← links)
- A class of polynomially solvable range constraints for interval analysis without widenings (Q2575737) (← links)
- Reservation table scheduling: branch-and-bound based optimization<i>vs</i>. integer linear programming techniques (Q3515395) (← links)
- On the Number of Rule Applications in Constraint Programs (Q4923523) (← links)