Strong equivalence made easy: nested expressions and weight constraints
Strong equivalence made easy: nested expressions and weight constraints
Logic programs and are strongly equivalent if, given any program $P \cup RQ \cup 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 …