Two results for proiritized logic programming

Details Two results for proiritized logic programming Two results for proiritized logic programming

2002-03-05

arxiv.org/abs/cs/0203007v1

Computer Science

Artificial Intelligence

20 pages, to be appeared in journal Theory and Practice of Logic Programming

Scientific paper

Prioritized default reasoning has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, many important aspects of prioritized default reasoning have yet to be thoroughly explored. In this paper, we investigate two properties of prioritized logic programs in the context of answer set semantics. Specifically, we reveal a close relationship between mutual defeasibility and uniqueness of the answer set for a prioritized logic program. We then explore how the splitting technique for extended logic programs can be extended to prioritized logic programs. We prove splitting theorems that can be used to simplify the evaluation of a prioritized logic program under certain conditions.

Affiliated with

Also associated with

No associations

Rating

Two results for proiritized logic programming 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 Two results for proiritized logic programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two results for proiritized logic programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-75747