Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics (2001) [11 citations — 0 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Lukasiewicz01fixpointcharacterizations,author = {Thomas Lukasiewicz},
title = {Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics},
booktitle = {In In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-01), number 2173 in Lecture Notes in Artificial Intelligence},
year = {2001},
pages = {336--350},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Abstract:
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 programming can be used to implement manyvalued disjunctive logic programming. Using these results on unfolding manyvaluedness, we then give many-valued fixpoint characterizations for the set of all minimal models and the least model state. We also describe an iterative fixpoint characterization for the perfect model semantics under finite local stratification. 1
