Robust Satisfiability for CSPs: Hardness and Algorithmic Results.
Víctor DalmauAndrei A. KrokhinPublished in: ACM Trans. Comput. Theory (2013)
Keyphrases
- phase transition
- np complete
- constraint satisfaction problems
- computational complexity
- constraint satisfaction
- satisfiability problem
- sat encodings
- symmetry breaking
- sat problem
- computationally efficient
- worst case
- special case
- random instances
- temporal logic
- partial occlusion
- learning theory
- decision procedures
- search space
- learning algorithm