Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
<p>We present many-valued disjunctive logic programs in which classical disjunctive logic program clauses are extended by a truth value that respects the material implication. Interestingly, these many-valued disjunctive logic programs have both a probabilistic semantics in probabilities over...
| 第一著者: | |
|---|---|
| フォーマット: | Conference item |
| 出版事項: |
Springer
1999
|
| _version_ | 1826259262952701952 |
|---|---|
| author | Lukasiewicz, T |
| author_facet | Lukasiewicz, T |
| author_sort | Lukasiewicz, T |
| collection | OXFORD |
| description | <p>We present many-valued disjunctive logic programs in which classical disjunctive logic program clauses are extended by a truth value that respects the material implication. Interestingly, these many-valued disjunctive logic programs have both a probabilistic semantics in probabilities over possible worlds and a truth-functional semantics. We then define minimal, perfect, and stable models and show that they have the same properties like their classical counterparts. In particular, perfect and stable models are always minimal models. Under local stratification, the perfect model semantics coincides with the stable model semantics. Finally, we show that some special cases of propositional many-valued disjunctive logic programming under minimal, perfect, and stable model semantics have the same complexity like their classical counterparts.</p> |
| first_indexed | 2024-03-06T18:47:06Z |
| format | Conference item |
| id | oxford-uuid:0ee3e958-7829-4a4e-bdb8-c4928aa474af |
| institution | University of Oxford |
| last_indexed | 2024-03-06T18:47:06Z |
| publishDate | 1999 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:0ee3e958-7829-4a4e-bdb8-c4928aa474af2022-03-26T09:48:23ZMany−Valued Disjunctive Logic Programs with Probabilistic SemanticsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:0ee3e958-7829-4a4e-bdb8-c4928aa474afDepartment of Computer ScienceSpringer1999Lukasiewicz, T<p>We present many-valued disjunctive logic programs in which classical disjunctive logic program clauses are extended by a truth value that respects the material implication. Interestingly, these many-valued disjunctive logic programs have both a probabilistic semantics in probabilities over possible worlds and a truth-functional semantics. We then define minimal, perfect, and stable models and show that they have the same properties like their classical counterparts. In particular, perfect and stable models are always minimal models. Under local stratification, the perfect model semantics coincides with the stable model semantics. Finally, we show that some special cases of propositional many-valued disjunctive logic programming under minimal, perfect, and stable model semantics have the same complexity like their classical counterparts.</p> |
| spellingShingle | Lukasiewicz, T Many−Valued Disjunctive Logic Programs with Probabilistic Semantics |
| title | Many−Valued Disjunctive Logic Programs with Probabilistic Semantics |
| title_full | Many−Valued Disjunctive Logic Programs with Probabilistic Semantics |
| title_fullStr | Many−Valued Disjunctive Logic Programs with Probabilistic Semantics |
| title_full_unstemmed | Many−Valued Disjunctive Logic Programs with Probabilistic Semantics |
| title_short | Many−Valued Disjunctive Logic Programs with Probabilistic Semantics |
| title_sort | many valued disjunctive logic programs with probabilistic semantics |
| work_keys_str_mv | AT lukasiewiczt manyvalueddisjunctivelogicprogramswithprobabilisticsemantics |