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. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Lierler, Y., & Lifschitz, V. (2011). Termination of grounding is not preserved by strongly equivalent transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6645 LNAI, pp. 205–210). https://doi.org/10.1007/978-3-642-20895-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
