One More Decidable Class of Finitely Ground Programs (2009)
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el.made the idea of efficient instantiation precise for the case of disjunctive programs with function symbols, and introduced the class of ``finitely ground'' programs that can be efficiently instantiated. Since that class is undecidable, it is important to find its large decidable subsets. In this paper, we introduce such a subset---the class of argument-restricted programs. It includes, in particular, all finite domain programs, ω-restricted programs, and λ-restricted programs.
View:
PDF
Citation:
In Proc. International Conference on Logic Programming (ICLP) 2009.
Bibtex:

Yuliya Lierler Ph.D. Alumni ylierler [at] unomaha edu
Vladimir Lifschitz Faculty vl [at] cs utexas edu