Regular and Sufficient Bounds of Finite Domain Constraints for Skeptical C-Inference.
Christoph BeierleSteven KutschPublished in: IEA/AIE (1) (2017)
Keyphrases
- finite domain
- constraint programming
- constraint satisfaction problems
- constraint propagation
- constraint solving
- constraint solver
- constraint logic programming
- satisfiability problem
- constraint satisfaction
- nonmonotonic inference
- lower bound
- combinatorial problems
- bounded treewidth
- state variables
- global constraints
- integer programming
- bayesian networks
- phase transition
- random variables
- probability distribution
- search space
- optimal solution