Tight Logic Programs

Details Tight Logic Programs Tight Logic Programs

2003-02-28

arxiv.org/abs/cs/0302038v1

Theory and Practice of Logic Programming, 3(4--5):499--518, 2003.

Computer Science

Artificial Intelligence

To appear in Special Issue of the Theory and Practice of Logic Programming Journal on Answer Set Programming, 2003

Scientific paper

This note is about the relationship between two theories of negation as failure -- one based on program completion, the other based on stable models, or answer sets. Francois Fages showed that if a logic program satisfies a certain syntactic condition, which is now called ``tightness,'' then its stable models can be characterized as the models of its completion. We extend the definition of tightness and Fages' theorem to programs with nested expressions in the bodies of rules, and study tight logic programs containing the definition of the transitive closure of a predicate.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-643558