Realization of c-Inference as a SAT Problem.
Christoph BeierleMartin von BergArthur SaninPublished in: FLAIRS (2022)
Keyphrases
- sat problem
- satisfiability problem
- sat solvers
- np complete
- constraint satisfaction problems
- phase transition
- boolean satisfiability
- randomly generated
- max sat
- sat solving
- sat instances
- decision problems
- propositional satisfiability
- bayesian networks
- constraint satisfaction
- weighted max sat
- random sat instances
- davis putnam
- search space
- search algorithm