Safe formulas in the general theory of stable models (preliminary report)

Joohyung Lee, Vladimir Lifschitz, Ravi Palla

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Abstract

Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding-to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence can be characterized by a formula of a simple syntactic form.

Original languageEnglish (US)
Title of host publicationLogic Programming - 24th International Conference, ICLP 2008, Proceedings
Pages672-676
Number of pages5
DOIs
StatePublished - 2008
Event24th International Conference on Logic Programming, ICLP 2008 - Udine, Italy
Duration: Dec 9 2008Dec 13 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5366 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other24th International Conference on Logic Programming, ICLP 2008
CountryItaly
CityUdine
Period12/9/0812/13/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Safe formulas in the general theory of stable models (preliminary report)'. Together they form a unique fingerprint.

Cite this