Conference item icon

Conference item

Probabilistic Logic Programming 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


Publisher:
Springer
Host title:
Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty‚ ECSQARU 1999‚ London‚ UK‚ July 5−9‚ 1999
Volume:
1638
Publication date:
1999-01-01
ISBN:
354066131X
UUID:
uuid:8db043e1-b3f1-4a3f-8f99-1bcf1acb77a1
Local pid:
cs:6743
Deposit date:
2015-03-31

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP