Browsing by Subject "Combinatorial problems"
Now showing items 1-1 of 1
-
Article
Propagation in CSP and SAT
(2006)Constraint Satisfaction Problems and Prepositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importance in both frameworks is that of constraint propagation. ...