-
Exact and approximate inference in graphical models: variable elimination and beyond
Probabilistic graphical models offer a powerful framework to account for...
06/29/2015 ∙ by Nathalie Peyrard, et al. ∙
0
∙
share
read it
-
Bounds Arc Consistency for Weighted CSPs
The Weighted Constraint Satisfaction Problem (WCSP) framework allows rep...
01/15/2014 ∙ by Matthias Zytnicki, et al. ∙
0
∙
share
read it
-
Possibilistic Constraint Satisfaction Problems or "How to handle soft constraints?"
Many AI synthesis problems such as planning or scheduling may be modeliz...
03/13/2013 ∙ by Thomas Schiex, et al. ∙
0
∙
share
read it
-
Penalty logic and its Link with Dempster-Shafer Theory
Penalty logic, introduced by Pinkas, associates to each formula of a kno...
02/27/2013 ∙ by Florence Dupin de Saint-Cyr, et al. ∙
0
∙
share
read it
