Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

JAIR
2007

favoriteEmaildiscussreport

108views more JAIR 2007»

Discovering Classes of Strongly Equivalent Logic Programs

13 years 4 months ago

Discovering Classes of Strongly Equivalent Logic Programs

Download www.cs.ust.hk

We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Speciﬁcally, with the help of computers, we discovered exact conditions that capture the strong equivalence between a set of a rule and the empty set, a set of a rule and another set of a rule, a set S of two rules and a subset of S with one rule, a set of two rules and a set of another rule, and a set S of three rules and a subset of S with two rules. We prove some general theorems that can help us verify the correctness of these conditions, and discuss the usefulness of our results in program simpliﬁcation.

Fangzhen Lin, Yin Chen

Real-time Traffic

Answer Set Semantics | Exact Conditions | JAIR 2007 | Strong Equivalence |

claim paper

Related Content

» On Modular Translations and Strong Equivalence

» Uniform Equivalence of Logic Programs under the Stable Model Semantics

» Strong and uniform equivalence of nonmonotonic theories an algebraic approach

» Strong order equivalence

» SELP A System for Studying Strong Equivalence Between Logic Programs

» Propositional theories are strongly equivalent to logic programs

» Simplifying Logic Programs Under Uniform and Strong Equivalence

» Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Progr...

» Equivalence for the G3stable models semantics

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JAIR
Authors	Fangzhen Lin, Yin Chen

Comments (0)