Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-grained Perspective into Boolean Constraint Satisfaction.
Marvin KünnemannDániel MarxPublished in: CoRR (2020)
Keyphrases
- fine grained
- constraint satisfaction
- brute force
- coarse grained
- constraint satisfaction problems
- heuristic search
- access control
- computationally expensive
- constraint programming
- arc consistency
- exhaustive search
- russian doll search
- constraint relaxation
- constraint propagation
- robust fault detection
- computer chess
- data lineage
- constraint solving
- constraint networks
- constraint optimization
- constrained problems
- constraint problems
- non binary
- neural network
- sat solvers
- high level