Upper and lower bounds for finite domain constraints to realize skeptical inference over conditional knowledge bases.
Christian KomoChristoph BeierlePublished in: ISAIM (2020)
Keyphrases
- upper and lower bounds
- finite domain
- constraint programming
- nonmonotonic inference
- constraint satisfaction problems
- constraint propagation
- knowledge base
- lower and upper bounds
- constraint solving
- upper bound
- constraint logic programming
- lower bound
- constraint solver
- constraint satisfaction
- bounded treewidth
- satisfiability problem
- sample complexity
- logic programming
- nonmonotonic reasoning
- global constraints
- state variables
- combinatorial problems
- straight forward
- bayesian networks
- decision trees
- default reasoning
- integer programming
- dynamic systems
- conditional probabilities
- knowledge representation
- belief revision
- np complete