我正在尝试解决无法始终验证约束满足的问题。我可以找到很多关于灵活约束满足的论文,但这并不是我想要的。这是一个例子:
P(Jim likes Cheese) = 0.8
P(Joe likes Cheese) = 0.5
P(Sam likes Cheese) = 0.2
P(Jim and Sam are friends) = 0.9
P(Jim and Joe are friends) = 0.5
P(Joe and Sam are friends) = 0.7
查理正在谈论两个喜欢奶酪的朋友。他最有可能在谈论谁?
我目前将此视为约束满足问题:
[likes cheese] [likes cheese]
| |
| /-------[alldiff]-------\ |
|/ \|
[X]--------[friends]--------[Y]
? ? ?
| | |
(Sam) (Joe) (Jim)
是否有处理此类 CSP 的现有方法?
CSP 甚至是解决问题的正确方法吗?