The operation of a typical answer set solver begins with grounding---replacing the given program with a program without variables that has the same answer sets. When the given program contains function symbols, the process of grounding may not terminate. In this note we give an example of a pair of consistent, strongly equivalent programs such that one of them can be grounded by Lparse, Dlv, and Gringo, and the other cannot.

PDF

In Logic Programming and Nonmonotonic Reasoning (LPNMR) 2011.

@inproceedings{lier11, title={Termination of Grounding is Not Preserved by Strongly Equivalent Transformations}, author={Yuliya Lierler and Vladimir Lifschitz}, booktitle={Logic Programming and Nonmonotonic Reasoning (LPNMR)}, url="http://www.cs.utexas.edu/users/ai-lab?lier11", year={2011} }