Journal article icon

Journal article

Nonmonotonic Probabilistic Logics under Variable−Strength Inheritance with Overriding: Complexity‚ Algorithms‚ and Implementation

Abstract:

In previous work, I have introduced nonmonotonic probabilistic logics under variable-strength inheritance with overriding. They are formalisms for probabilistic reasoning from sets of strict logical, default logical, and default probabilistic sentences, which are parameterized through a value lambda in [0,1] that describes the strength of the inheritance of default probabilistic knowledge. In this paper, I continue this line of research. I give a precise picture of the complexity of decidi...

Expand abstract

Actions


Authors


Thomas Lukasiewicz More by this author
Journal:
International Journal of Approximate Reasoning
Volume:
44
Issue:
3
Pages:
301-321
Publication date:
2007-03-01
URN:
uuid:796e83cf-fd8d-447b-a939-86b6e4b7daf8
Local pid:
cs:4653

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