Strong equivalence of grounded disjunctive logic programs is characterized here by a calculus that does not involve syntactically complex formulas.

PDF

In Technical Communications of the 27th International Conference on Logic Programming, pp. 11-15 2011.

@incollection{Bochman:unpublished11, title={Yet Another Characterization of Strong Equivalence}, author={Alexander Bochman and Vladimir Lifschitz}, booktitle={Technical Communications of the 27th International Conference on Logic Programming}, pages={11-15}, url="http://www.cs.utexas.edu/users/ai-lab?Bochman:unpublished11", year={2011} }