Conference item icon

Conference item

Probabilistic Logic under Coherence: Complexity and Algorithms

Abstract:

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore the relationship between coherence-based and classical model-theoretic probabilistic logic. Interestingly, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Using these results, we analyze the computational complexity of probabilistic reasoning un...

Expand abstract

Actions


Authors


Veronica Biazzo More by this author
Angelo Gilio More by this author
Thomas Lukasiewicz More by this author
Giuseppe Sanfilippo More by this author
Publisher:
Shaker
Publication date:
2001
URN:
uuid:1ddf7b8b-00ef-45ec-8473-b5c9a91cb06d
Local pid:
cs:6729
ISBN:
90-423-0130-9

Terms of use


Metrics



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

TO TOP