Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin.
Miriam BackensAndrei BulatovLeslie Ann GoldbergColin McQuillanStanislav ZivnýPublished in: CoRR (2018)
Keyphrases
- constraint satisfaction problems
- real valued data
- boolean functions
- magnetic field
- constraint satisfaction
- search space
- real valued
- arc consistency
- decision diagrams
- genetic algorithm
- constraint propagation
- data sets
- non binary
- neural network
- special case
- constraint networks
- efficient computation
- exact solution
- linear functions
- room temperature
- solving constraint satisfaction problems