TY - GEN
T1 - Safe formulas in the general theory of stable models (preliminary report)
AU - Lee, Joohyung
AU - Lifschitz, Vladimir
AU - Palla, Ravi
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=58549116573&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58549116573&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-89982-2_55
DO - 10.1007/978-3-540-89982-2_55
M3 - Conference contribution
AN - SCOPUS:58549116573
SN - 3540899812
SN - 9783540899815
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 672
EP - 676
BT - Logic Programming - 24th International Conference, ICLP 2008, Proceedings
T2 - 24th International Conference on Logic Programming, ICLP 2008
Y2 - 9 December 2008 through 13 December 2008
ER -