Conference item
Credal Networks under Maximum Entropy
- Abstract:
-
In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by defining probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an efficient linear programming characterization for the problem of deciding whether a probabilistic logic program is satisfiable. Finally, and as a central contribution of this paper, we introduce an efficient technique for approxi...
Expand abstract
Actions
Authors
Bibliographic Details
- Publisher:
- Morgan Kaufmann
- Host title:
- Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence‚ UAI 2000‚ Stanford‚ California‚ USA‚ June 30 − July 3‚ 2000
- Publication date:
- 2000-01-01
- ISBN:
- 1558607099
Item Description
- UUID:
-
uuid:0a892a13-b60a-4e9a-ba47-a65ba2b89ac1
- Local pid:
- cs:6741
- Deposit date:
- 2015-03-31
Terms of use
- Copyright date:
- 2000
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record