Safe Formulas in the General Theory of Stable Models (Preliminary Report)

@inproceedings{Lee2008SafeFI,
  title={Safe Formulas in the General Theory of Stable Models (Preliminary Report)},
  author={Joohyung Lee and Vladimir Lifschitz and Ravi Palla},
  booktitle={ICLP},
  year={2008}
}
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 the stable models of a safe sentence can be… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

ACM Transactions on Computational Logic

Nicola Leone, Wolfgang Faber, +5 authors reasoning
7(3):499–562, • 2006
View 1 Excerpt
Highly Influenced

A revised

Cabalar et al, 2009 Pedro Cabalar, David Pearce, Agustin Valverde
2009

In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI)

Joohyung Lee, Vladimir Lifschitz, Ravi Palla. A reductive semantics for counting, choice in answer set programming
pages 472–479, • 2008
View 9 Excerpts

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

Joohyung Lee, Vladimir Lifschitz, Ravi Palla
Proceedings of International Conference on Logic Programming (ICLP), pages 672–676, • 2008
View 7 Excerpts

In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI)

Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz. A new perspective on stable models
pages 372–379, • 2007

Similar Papers

Loading similar papers…