Combining Probabilistic Logic Programming with the Power of Maximum Entropy
<p>This paper is on the combination of two powerful approaches to uncertain reasoning: logic programming in a probabilistic setting, on the one hand, and the information-theoretical principle of maximum entropy, on the other hand. More precisely, we present two approaches to probabilistic logi...
| Hauptverfasser: | , |
|---|---|
| Format: | Journal article |
| Veröffentlicht: |
2004
|
| _version_ | 1826290997414330368 |
|---|---|
| author | Kern−Isberner, G Lukasiewicz, T |
| author_facet | Kern−Isberner, G Lukasiewicz, T |
| author_sort | Kern−Isberner, G |
| collection | OXFORD |
| description | <p>This paper is on the combination of two powerful approaches to uncertain reasoning: logic programming in a probabilistic setting, on the one hand, and the information-theoretical principle of maximum entropy, on the other hand. More precisely, we present two approaches to probabilistic logic programming under maximum entropy. The first one is based on the usual notion of entailment under maximum entropy, and is defined for the very general case of probabilistic logic programs over Boolean events. The second one is based on a new notion of entailment under maximum entropy, where the principle of maximum entropy is coupled with the closed world assumption (CWA) from classical logic programming. It is only defined for the more restricted case of probabilistic logic programs over conjunctive events. We then analyze the nonmonotonic behavior of both approaches along benchmark examples and along general properties for default reasoning from conditional knowledge bases. It turns out that both approaches have very nice nonmonotonic features. In particular, they realize some inheritance of probabilistic knowledge along subclass relationships, without suffering from the problem of inheritance blocking and from the drowning problem. They both also satisfy the property of rational monotonicity and several irrelevance properties. We finally present algorithms for both approaches, which are based on generalizations of recent techniques for probabilistic logic programming under logical entailment. The algorithm for the first approach still produces quite large weighted entropy maximization problems, while the one for the second approach generates optimization problems of the same size as the ones produced in probabilistic logic programming under logical entailment.</p> |
| first_indexed | 2024-03-07T02:52:45Z |
| format | Journal article |
| id | oxford-uuid:ae3d4552-0d9e-4b6a-909c-6a3c711e1b9a |
| institution | University of Oxford |
| last_indexed | 2024-03-07T02:52:45Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | oxford-uuid:ae3d4552-0d9e-4b6a-909c-6a3c711e1b9a2022-03-27T03:41:10ZCombining Probabilistic Logic Programming with the Power of Maximum EntropyJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:ae3d4552-0d9e-4b6a-909c-6a3c711e1b9aDepartment of Computer Science2004Kern−Isberner, GLukasiewicz, T<p>This paper is on the combination of two powerful approaches to uncertain reasoning: logic programming in a probabilistic setting, on the one hand, and the information-theoretical principle of maximum entropy, on the other hand. More precisely, we present two approaches to probabilistic logic programming under maximum entropy. The first one is based on the usual notion of entailment under maximum entropy, and is defined for the very general case of probabilistic logic programs over Boolean events. The second one is based on a new notion of entailment under maximum entropy, where the principle of maximum entropy is coupled with the closed world assumption (CWA) from classical logic programming. It is only defined for the more restricted case of probabilistic logic programs over conjunctive events. We then analyze the nonmonotonic behavior of both approaches along benchmark examples and along general properties for default reasoning from conditional knowledge bases. It turns out that both approaches have very nice nonmonotonic features. In particular, they realize some inheritance of probabilistic knowledge along subclass relationships, without suffering from the problem of inheritance blocking and from the drowning problem. They both also satisfy the property of rational monotonicity and several irrelevance properties. We finally present algorithms for both approaches, which are based on generalizations of recent techniques for probabilistic logic programming under logical entailment. The algorithm for the first approach still produces quite large weighted entropy maximization problems, while the one for the second approach generates optimization problems of the same size as the ones produced in probabilistic logic programming under logical entailment.</p> |
| spellingShingle | Kern−Isberner, G Lukasiewicz, T Combining Probabilistic Logic Programming with the Power of Maximum Entropy |
| title | Combining Probabilistic Logic Programming with the Power of Maximum Entropy |
| title_full | Combining Probabilistic Logic Programming with the Power of Maximum Entropy |
| title_fullStr | Combining Probabilistic Logic Programming with the Power of Maximum Entropy |
| title_full_unstemmed | Combining Probabilistic Logic Programming with the Power of Maximum Entropy |
| title_short | Combining Probabilistic Logic Programming with the Power of Maximum Entropy |
| title_sort | combining probabilistic logic programming with the power of maximum entropy |
| work_keys_str_mv | AT kernisbernerg combiningprobabilisticlogicprogrammingwiththepowerofmaximumentropy AT lukasiewiczt combiningprobabilisticlogicprogrammingwiththepowerofmaximumentropy |