Preferred Answer Sets for Ordered Logic Programs

Details Preferred Answer Sets for Ordered Logic Programs Preferred Answer Sets for Ordered Logic Programs

2004-07-19

arxiv.org/abs/cs/0407049v1

Computer Science

Logic in Computer Science

To appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a ``best'' answer set. Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a preference for satisfying certain rules, possibly at the cost of violating less important ones. We show that such a rule order induces a natural order on extended answer sets, the minimal elements of which we call preferred answer sets. We characterize the expressiveness of the resulting semantics and show that it can simulate negation as failure, disjunction and some other formalisms such as logic programs with ordered disjunction. The approach is shown to be useful in several application areas, e.g. repairing database, where minimal repairs correspond to preferred answer sets. To appear in Theory and Practice of Logic Programming (TPLP).

Affiliated with

Also associated with

No associations

Rating

Preferred Answer Sets for Ordered 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 Preferred Answer Sets for Ordered Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Preferred Answer Sets for Ordered Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-143118