Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs

Details Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs

2003-01-14

arxiv.org/abs/cs/0301010v2

Computer Science

Artificial Intelligence

31 pages

Scientific paper

Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which semantics is the most intended. In this paper we look at disjunctive well-founded reasoning from different angles. We show that there is an intuitive form of the well-founded reasoning in disjunctive logic programming which can be characterized by slightly modifying some exisitng approaches to defining disjunctive well-founded semantics, including program transformations, argumentation, unfounded sets (and resolution-like procedure). We also provide a bottom-up procedure for this semantics. The significance of our work is not only in clarifying the relationship among different approaches, but also shed some light on what is an intended well-founded semantics for disjunctive logic programs.

Affiliated with

Also associated with

No associations

Rating

Comparisons and Computation of Well-founded Semantics for Disjunctive Logic 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 Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-220096