Discovering Classes of Strongly Equivalent Logic Programs

Details Discovering Classes of Strongly Equivalent Logic Programs Discovering Classes of Strongly Equivalent Logic Programs

2011-10-12

arxiv.org/abs/1110.2738v1

Journal Of Artificial Intelligence Research, Volume 28, pages 431-451, 2007

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.2131

In this paper we apply computer-aided theorem discovery technique to discover theorems about strongly equivalent logic programs under the answer set semantics. Our discovered theorems capture new classes of strongly equivalent logic programs that can lead to new program simplification rules that preserve strong equivalence. Specifically, with the help of computers, we discovered exact conditions that capture the strong equivalence between a rule and the empty set, between two rules, between two rules and one of the two rules, between two rules and another rule, and between three rules and two of the three rules.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-634486