Conference item icon

Conference item

Fixpoint Characterizations for Many−Valued Disjunctive Logic Programs with Probabilistic Semantics

Abstract:

In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for such programs. We show that many-valued disjunctive logic programs under the semantics of minimal models, perfect models, stable models, and least model states can be unfolded to equivalent classical disjunctive logic programs under the respective semantics. Thus, existing technology for classical disjunctive logic ...

Expand abstract

Actions


Authors


Publisher:
Springer
Volume:
2173
Host title:
Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning‚ LPNMR 2001‚ Vienna‚ Austria‚ September 17−19‚ 2001
Publication date:
2001-01-01
ISBN:
3540425934
UUID:
uuid:d0107f67-0b50-415c-ad6c-163217c3fcde
Local pid:
cs:6731
Deposit date:
2015-03-31

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP