One More Decidable Class of Finitely Ground Programs

  • Yuliya Lierler
  • Vladimir Lifschitz
Conference paper

DOI: 10.1007/978-3-642-02846-5_40

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5649)
Cite this paper as:
Lierler Y., Lifschitz V. (2009) One More Decidable Class of Finitely Ground Programs. In: Hill P.M., Warren D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Yuliya Lierler
    • 1
  • Vladimir Lifschitz
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinUSA

Personalised recommendations