Alternative Characterizations for Strong Equivalence of Logic Programs

Details Alternative Characterizations for Strong Equivalence of Logic Programs Alternative Characterizations for Strong Equivalence of Logic Programs

2002-07-09

arxiv.org/abs/cs/0207032v1

Computer Science

Artificial Intelligence

15 pages, Workshop on Non-monotonic Reasoning (NMR'02), Toulouse, 2002

Scientific paper

In this work we present additional results related to the property of strong equivalence of logic programs. This property asserts that two programs share the same set of stable models, even under the addition of new rules. As shown in a recent work by Lifschitz, Pearce and Valverde, strong equivalence can be simply reduced to equivalence in the logic of Here-and-There (HT). In this paper we provide two alternatives respectively based on classical logic and 3-valued logic. The former is applicable to general rules, but not for nested expressions, whereas the latter is applicable for nested expressions but, when moving to an unrestricted syntax, it generally yields different results from HT.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-336678