Fages' Theorem and Answer Set Programming

Details Fages' Theorem and Answer Set Programming Fages' Theorem and Answer Set Programming

2000-03-09

arxiv.org/abs/cs/0003042v1

Computer Science

Artificial Intelligence

Scientific paper

We generalize a theorem by Francois Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as smodels and dlv is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelae is discussed as an example.

Affiliated with

Also associated with

No associations

Rating

Fages' Theorem and Answer Set 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 Fages' Theorem and Answer Set Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fages' Theorem and Answer Set Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653649