Article
Termination of Grounding is Not Preserved by Strongly Equivalent Transformations
Computer Science Faculty Proceedings & Presentations
Document Type
Conference Proceeding
Publication Date
1-1-2011
Disciplines
Abstract
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.
Citation Information
Yuliya Lierler and Vladimir Lifschitz. "Termination of Grounding is Not Preserved by Strongly Equivalent Transformations" (2011) Available at: http://works.bepress.com/yuliya_lierler/6/
11th International Conference on Logic Programming and Nonmonotonic Reasoning