Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps.
Gabriel IstratePublished in: J. Univers. Comput. Sci. (2007)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- random instances
- constraint propagation
- np hard
- np complete
- constraint programming
- partial assignment
- constraint solving
- search space
- arc consistency
- binary csps
- non binary
- constraint networks
- finding optimal solutions
- decomposition methods
- forward checking
- computational problems
- dynamic constraint satisfaction problems
- pseudo boolean optimization
- finite domain
- soft constraints
- sat problem
- combinatorial problems
- boolean functions
- constraint optimization
- global constraints
- randomly generated
- constraint solvers
- consistency maintenance
- solving constraint satisfaction problems