Probabilistic Logic Programming with Conditional Constraints
<p>We introduce a new approach to probabilistic logic programming in which probabilities are defined over a set of possible worlds. More precisely, classical program clauses are extended by a subinterval of [0,1] that describes a range for the conditional probability of the head of a clause gi...
| Glavni avtor: | |
|---|---|
| Format: | Journal article |
| Izdano: |
2001
|
| _version_ | 1826272486695632896 |
|---|---|
| author | Lukasiewicz, T |
| author_facet | Lukasiewicz, T |
| author_sort | Lukasiewicz, T |
| collection | OXFORD |
| description | <p>We introduce a new approach to probabilistic logic programming in which probabilities are defined over a set of possible worlds. More precisely, classical program clauses are extended by a subinterval of [0,1] that describes a range for the conditional probability of the head of a clause given its body. We then analyze the complexity of selected probabilistic logic programming tasks. It turns out that probabilistic logic programming is computationally more complex than classical logic programming. More precisely, the tractability of special cases of classical logic programming generally does not carry over to the corresponding special cases of probabilistic logic programming. Moreover, we also draw a precise picture of the complexity of deciding and computing tight logical consequences in probabilistic reasoning with conditional constraints in general. We then present linear optimization techniques for deciding satisfiability and computing tight logical consequences of probabilistic logic programs. These techniques are efficient in the special case in which we have little relevant purely probabilistic knowledge.We finally show that probabilistic logic programming under certain syntactic and semantic restrictions is closely related to van Emden's quantitative deduction, and thus has computational properties similar to classical logic programming. Based on this result, we present an efficient approximation technique for probabilistic logic programming.</p> |
| first_indexed | 2024-03-06T22:13:19Z |
| format | Journal article |
| id | oxford-uuid:528d4846-4ab7-4f60-9dd2-e92b5b294654 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T22:13:19Z |
| publishDate | 2001 |
| record_format | dspace |
| spelling | oxford-uuid:528d4846-4ab7-4f60-9dd2-e92b5b2946542022-03-26T16:26:13ZProbabilistic Logic Programming with Conditional ConstraintsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:528d4846-4ab7-4f60-9dd2-e92b5b294654Department of Computer Science2001Lukasiewicz, T<p>We introduce a new approach to probabilistic logic programming in which probabilities are defined over a set of possible worlds. More precisely, classical program clauses are extended by a subinterval of [0,1] that describes a range for the conditional probability of the head of a clause given its body. We then analyze the complexity of selected probabilistic logic programming tasks. It turns out that probabilistic logic programming is computationally more complex than classical logic programming. More precisely, the tractability of special cases of classical logic programming generally does not carry over to the corresponding special cases of probabilistic logic programming. Moreover, we also draw a precise picture of the complexity of deciding and computing tight logical consequences in probabilistic reasoning with conditional constraints in general. We then present linear optimization techniques for deciding satisfiability and computing tight logical consequences of probabilistic logic programs. These techniques are efficient in the special case in which we have little relevant purely probabilistic knowledge.We finally show that probabilistic logic programming under certain syntactic and semantic restrictions is closely related to van Emden's quantitative deduction, and thus has computational properties similar to classical logic programming. Based on this result, we present an efficient approximation technique for probabilistic logic programming.</p> |
| spellingShingle | Lukasiewicz, T Probabilistic Logic Programming with Conditional Constraints |
| title | Probabilistic Logic Programming with Conditional Constraints |
| title_full | Probabilistic Logic Programming with Conditional Constraints |
| title_fullStr | Probabilistic Logic Programming with Conditional Constraints |
| title_full_unstemmed | Probabilistic Logic Programming with Conditional Constraints |
| title_short | Probabilistic Logic Programming with Conditional Constraints |
| title_sort | probabilistic logic programming with conditional constraints |
| work_keys_str_mv | AT lukasiewiczt probabilisticlogicprogrammingwithconditionalconstraints |