Computer Science – Artificial Intelligence
Scientific paper
2011-06-03
Computer Science
Artificial Intelligence
37 pages, 5 figures. To appear in Theory and Practice of Logic Programming (TPLP)
Scientific paper
In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses which are able to capture incomplete information and incomplete states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic theory, a construction of a possibilistic logic programming semantic based on answer sets and the proof theory of possibilistic logic is defined. It shows that this possibilistic semantics for disjunctive logic programs can be characterized by a fixed-point operator. It is also shown that the suggested possibilistic semantics can be computed by a resolution algorithm and the consideration of optimal refutations from a possibilistic logic theory. In order to manage inconsistent possibilistic logic programs, a preference criterion between inconsistent possibilistic models is defined; in addition, the approach of cuts for restoring consistency of an inconsistent possibilistic knowledge base is adopted. The approach is illustrated in a medical scenario.
Cortés Ulises
Nieves Juan Carlos
Osorio Mauricio
No associations
LandOfFree
Semantics for Possibilistic Disjunctive Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Semantics for Possibilistic Disjunctive Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semantics for Possibilistic Disjunctive Programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-7011