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.

PDF

In Proc. International Conference on Logic Programming (ICLP) 2009.

@inproceedings{lierler:iclp09, title={One More Decidable Class of Finitely Ground Programs}, author={Yuliya Lierler and Vladimir Lifschitz}, booktitle={Proc. International Conference on Logic Programming (ICLP)}, url="http://www.cs.utexas.edu/users/ai-lab?lierler:iclp09", year={2009} }