Strong Equivalence Made Easy: Nested Expressions and Weight Constraints

@article{Turner2003StrongEM,
  title={Strong Equivalence Made Easy: Nested Expressions and Weight Constraints},
  author={Hudson Turner},
  journal={TPLP},
  year={2003},
  volume={3},
  pages={609-622}
}
Logic programs P and Q are strongly equivalent if, given any program R, programs P ∪R and Q ∪R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without considering the whole program. Lifschitz, Pearce and Valverde showed that Heyting’s logic of here-and-there can be used to characterize strong equivalence for logic programs with nested expressions… CONTINUE READING
Highly Influential
This paper has highly influenced 31 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 157 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

157 Citations

01020'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 157 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…