Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic.
Christian GlaßerPeter JonssonBarnaby MartinPublished in: CiE (2016)
Keyphrases
- constraint satisfaction
- phase transition
- constraint satisfaction problems
- first order logic
- satisfiability problem
- micron cmos
- propositional logic
- sat problem
- np complete
- relaxation labeling
- combinatorial problems
- constraint programming
- heuristic search
- randomly generated
- constraint relaxation
- constraint networks
- constraint propagation
- computational complexity
- sat solvers
- stochastic local search
- constraint solving
- forward checking
- probabilistic reasoning
- random instances
- constrained problems
- arc consistency
- optimal solution
- cnf formula
- constraint problems
- max sat
- soft constraints
- neural network
- davis putnam
- russian doll search