The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem
Harold S. ConnamacherMichael MolloyPublished in: CoRR (2012)
Keyphrases
- constraint satisfaction problems
- np complete
- random instances
- constraint satisfaction
- sat problem
- randomly generated
- satisfiability problem
- constraint propagation
- phase transition
- np hard
- constraint programming
- computational complexity
- reasoning problems
- symmetry breaking
- constraint solving
- combinatorial problems
- tractable subclasses
- sat encodings
- arc consistency
- constraint networks
- binary csps
- constraint problems
- non binary
- computational problems
- soft constraints
- partial constraint satisfaction
- decomposition methods
- global constraints
- cnf formula
- hard constraints
- conjunctive queries
- forward checking
- constraint graph
- sat solvers
- finding optimal solutions
- disjunctive constraints
- propositional logic
- modal logic
- path consistency