Intelligent Instantiation and Supersafe Rules

Author Vladimir Lifschitz

Thumbnail PDF


  • Filesize: 0.52 MB
  • 14 pages

Document Identifiers

Author Details

Vladimir Lifschitz

Cite AsGet BibTex

Vladimir Lifschitz. Intelligent Instantiation and Supersafe Rules. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


In the input languages of most answer set solvers, a rule with variables has, conceptually, infinitely many instances. The primary role of the process of intelligent instillation is to identify a finite set of ground instances of rules of the given program that are "essential" for generating its stable models. This process can be launched only when all rules of the program are safe. If a program contains arithmetic operations or comparisons then its rules are expected to satisfy conditions that are even stronger than safety. This paper is an attempt to make the idea of an essential instance and the need for "supersafety" in the process of intelligent instantiation mathematically precise.
  • answer set programming


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Evgenii Balai, Michael Gelfond, and Yuanlin Zhang. Towards answer set programming with sorts. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pages 135-147, 2013. Google Scholar
  2. Annamaria Bria, Wolfgang Faber, and Nicola Leone. Normal form nested programs. In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA), 2008. Google Scholar
  3. Pedro Cabalar, David Pearce, and Agustin Valverde. A revised concept of safety for general answer set programs. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 2009. Google Scholar
  4. Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, and Nicola Leone. Computable functions in ASP: theory and implementation. In Proceedings of International Conference on Logic Programming (ICLP), pages 407-424, 2008. Google Scholar
  5. Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, and Torsten Schaub. Abstract Gringo. Theory and Practice of Logic Programming, 15:449-463, 2015. Google Scholar
  6. Joohyung Lee, Vladimir Lifschitz, and Ravi Palla. Safe formulas in the general theory of stable models (preliminary report). In Proceedings of International Conference on Logic Programming (ICLP), pages 672-676, 2008. Google Scholar
  7. Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369-389, 1999. Google Scholar
  8. Yuri Matiyasevich. Hilbert’s Tenth Problem. MIT Press, 1993. Google Scholar
  9. Norman McCain and Hudson Turner. Language independence and language tolerance in logic programs. In Pascal Van Hentenryck, editor, Proceedings Eleventh International Conference on Logic Programming, pages 38-57, 1994. Google Scholar