Extending Disjunctive Logic Programming by T-norms (1999)
| Venue: | In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 1730 of LNAI |
| Citations: | 8 - 0 self |
BibTeX
@INPROCEEDINGS{Mateis99extendingdisjunctive,
author = {Cristinel Mateis},
title = {Extending Disjunctive Logic Programming by T-norms},
booktitle = {In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 1730 of LNAI},
year = {1999},
pages = {290--304},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper proposes a new knowledge representation language, called QDLP, which extends DLP to deal with uncertain values. A certainty degree interval (a subinterval of [0; 1]) is assigned to each (quantitative) rule. Triangular norms (T -norms) are employed to define calculi for propagating uncertainty information from the premises to the conclusion of a quantitative rule. Negation is considered and the concept of stable model is extended to QDLP. Different T -norms induce different semantics for one given quantitative program. In this sense, QDLP is parameterized and each choice of a T -norm induces a different QDLP language. Each T -norm is eligible for events with determinate relationships (e.g., independence, exclusiveness) between them. Since there are infinitely many T -norms, it turns out that there is a family of infinitely many QDLP languages. This family is carefully studied and the set of QDLP languages which generalize traditional DLP is precisely singled out. Finally, ...
