Skeptical Inference Based on C-Representations and Its Characterization as a Constraint Satisfaction Problem.
Christoph BeierleChristian EichhornGabriele Kern-IsbernerPublished in: FoIKS (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- nonmonotonic inference
- constraint propagation
- np complete
- probabilistic reasoning
- probabilistic inference
- default reasoning
- non binary
- np hard
- constraint programming
- graph based representations
- constraint solving
- search space
- arc consistency
- partial constraint satisfaction
- soft constraints
- tractable subclasses
- pseudo boolean optimization
- global constraints
- decomposition methods
- constraint networks
- hard constraints
- constraint problems
- path consistency
- graphical models
- finite domain
- inference in bayesian networks
- backtracking algorithm
- distributed constraint satisfaction problems
- tractable classes
- finding optimal solutions
- temporal constraints
- phase transition
- special case