Final remarks. Constraint resolution theories
Résumé
Remarks about our approach of the finite CSP, regarding: - its distinctive features, - our specific resolution rules (whips, braids, g-whips, ...), - using these rules for human solving, - similarity between Subsets and whips, - minimal instances and uniqueness, - minimal instances vs density and tightness of constraints, - strategic level, - rating of instances and the notion of a "simplest" solution, - application to the Sudoku CSP.
Domaines
Intelligence artificielle [cs.AI]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...