Extending forward checking
From MaRDI portal
Recommendations
- A theoretical evaluation of selected backtracking algorithms.
- Forward checking and intelligent backtracking
- On forward checking for non-binary constraint satisfaction
- Constraint processing. Proceedings of workshops held in conjunction with the international congress on computer systems and applied mathematics (CSAM '93) in St. Petersburg, Russia and the European conference on artificial intelligence (ECAI '94) held in
- Recent Advances in Constraints
Cited in
(10)- Reasoning from last conflict(s) in constraint programming
- A theoretical evaluation of selected backtracking algorithms.
- Backjump-based backtracking for constraint satisfaction problems
- On the relations between SAT and CSP enumerative algorithms
- On forward checking for non-binary constraint satisfaction.
- Constraint processing. Proceedings of workshops held in conjunction with the international congress on computer systems and applied mathematics (CSAM '93) in St. Petersburg, Russia and the European conference on artificial intelligence (ECAI '94) held in Amsterdam, Netherlands
- A CSP search algorithm with responsibility sets and kernels
- Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
- Assumption-Based Pruning in Conditional CSP
- On forward checking for non-binary constraint satisfaction
This page was built for publication: Extending forward checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472551)