StatSAT: A Boolean Satisfiability based Attack on Logic-Locked Probabilistic Circuits.
Ankit MondalMichael ZuzakAnkur SrivastavaPublished in: DAC (2020)
Keyphrases
- boolean satisfiability
- probabilistic planning
- boolean optimization
- sat solvers
- sat solving
- branch and bound algorithm
- integer linear programming
- planning under uncertainty
- randomly generated
- sat problem
- planning problems
- heuristic search
- sat instances
- random sat instances
- automated reasoning
- computational properties
- symmetry breaking
- boolean formula
- decision theoretic
- genetic algorithm
- markov decision processes
- logic programming
- special case
- learning algorithm