Termination of grounding is not preserved by strongly equivalent transformations

Authors:
Yuliya Lierler;Vladimir Lifschitz
Affiliations:
University of Kentucky;University of Texas at Austin
Venue:
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Year:
2011

Citing 5
Cited 0

A short introduction to intuitionistic logic

A short introduction to intuitionistic logic
Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Computable Functions in ASP: Theory and Implementation

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
One More Decidable Class of Finitely Ground Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A characterization of strong equivalence for logic programs with variables

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning

Quantified Score

Hi-index	0.00

Visualization

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.