Computer Science – Artificial Intelligence
Scientific paper
2002-07-15
Computer Science
Artificial Intelligence
Proceedings of the Workshop on Preferences in Artificial Intelligence and Constraint In: Proceedings of the Workshop on Non-Mo
Scientific paper
We analyze the problem of defining well-founded semantics for ordered logic programs within a general framework based on alternating fixpoint theory. We start by showing that generalizations of existing answer set approaches to preference are too weak in the setting of well-founded semantics. We then specify some informal yet intuitive criteria and propose a semantical framework for preference handling that is more suitable for defining well-founded semantics for ordered logic programs. The suitability of the new approach is convinced by the fact that many attractive properties are satisfied by our semantics. In particular, our semantics is still correct with respect to various existing answer sets semantics while it successfully overcomes the weakness of their generalization to well-founded semantics. Finally, we indicate how an existing preferred well-founded semantics can be captured within our semantical framework.
Schaub Torsten
Wang Kewen
No associations
LandOfFree
Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report 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 Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-375975