Nonmonotonic Probabilistic Logics under Variable−Strength Inheritance with Overriding: Complexity‚ Algorithms‚ and Implementation
<p>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 val...
| Glavni autor: | |
|---|---|
| Format: | Journal article |
| Izdano: |
2007
|
| _version_ | 1826280299636457472 |
|---|---|
| author | Lukasiewicz, T |
| author_facet | Lukasiewicz, T |
| author_sort | Lukasiewicz, T |
| collection | OXFORD |
| description | <p>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 deciding consistency of strength lambda and of computing tight consequences of strength lambda. Furthermore, I present algorithms for these tasks, which are based on reductions to the standard problems of deciding satisfiability and of computing tight logical consequences in model-theoretic probabilistic logic. Finally, I describe the system nmproblog, which includes a prototype implementation of these algorithms.</p> |
| first_indexed | 2024-03-07T00:11:37Z |
| format | Journal article |
| id | oxford-uuid:796e83cf-fd8d-447b-a939-86b6e4b7daf8 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T00:11:37Z |
| publishDate | 2007 |
| record_format | dspace |
| spelling | oxford-uuid:796e83cf-fd8d-447b-a939-86b6e4b7daf82022-03-26T20:37:23ZNonmonotonic Probabilistic Logics under Variable−Strength Inheritance with Overriding: Complexity‚ Algorithms‚ and ImplementationJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:796e83cf-fd8d-447b-a939-86b6e4b7daf8Department of Computer Science2007Lukasiewicz, T<p>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 deciding consistency of strength lambda and of computing tight consequences of strength lambda. Furthermore, I present algorithms for these tasks, which are based on reductions to the standard problems of deciding satisfiability and of computing tight logical consequences in model-theoretic probabilistic logic. Finally, I describe the system nmproblog, which includes a prototype implementation of these algorithms.</p> |
| spellingShingle | Lukasiewicz, T Nonmonotonic Probabilistic Logics under Variable−Strength Inheritance with Overriding: Complexity‚ Algorithms‚ and Implementation |
| title | Nonmonotonic Probabilistic Logics under Variable−Strength Inheritance with Overriding: Complexity‚ Algorithms‚ and Implementation |
| title_full | Nonmonotonic Probabilistic Logics under Variable−Strength Inheritance with Overriding: Complexity‚ Algorithms‚ and Implementation |
| title_fullStr | Nonmonotonic Probabilistic Logics under Variable−Strength Inheritance with Overriding: Complexity‚ Algorithms‚ and Implementation |
| title_full_unstemmed | Nonmonotonic Probabilistic Logics under Variable−Strength Inheritance with Overriding: Complexity‚ Algorithms‚ and Implementation |
| title_short | Nonmonotonic Probabilistic Logics under Variable−Strength Inheritance with Overriding: Complexity‚ Algorithms‚ and Implementation |
| title_sort | nonmonotonic probabilistic logics under variable strength inheritance with overriding complexity algorithms and implementation |
| work_keys_str_mv | AT lukasiewiczt nonmonotonicprobabilisticlogicsundervariablestrengthinheritancewithoverridingcomplexityalgorithmsandimplementation |