First-Order Stable Model Semantics and First-Order Loop Formulas

Lin and Zhaos theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the first-order case. We investigate the precise relationship between the first-order stable model semantics and first-order loop formulas, and study conditions under which the former can be represented by the latter. In order to facilitate the comparison, we extend the definition of a first-order loop formula which was limited to a nondisjunctive program, to a disjunctive program and to an arbitrary first-order theory. Based on the studied relationship we extend the syntax of a logic program with explicit quantifiers, which allows us to do reasoning involving non-Herbrand stable models using first-order reasoners. Such programs can be viewed as a special class of first-order theories under the stable model semantics, which yields more succinct loop formulas than the general language due to their restricted syntax.

💡 Research Summary

The paper investigates the exact relationship between first‑order stable model semantics (FOSMS) and first‑order loop formulas (FOLF), addressing the gap that exists when Lin and Zhao’s propositional loop‑formula theorem is lifted to the first‑order setting. The authors first identify why the original result does not directly carry over: variables and quantifiers introduce dependencies that cannot be captured by the simple notion of a “loop” as a set of atoms, and nondisjunctive programs are insufficiently expressive for many first‑order theories.

To overcome these obstacles, the authors propose three major contributions.

1. Generalized definition of loop formulas – They redefine a loop as a collection of quantified sub‑formulas rather than a bare set of atoms. For each loop L they construct a first‑order loop formula LF(L) that forces every atom in L to be justified internally while preventing external support. The formula has the shape
    ∀X (∧_{A∈L} A(X) → ∃Y (Body(L,Y) ∧ ¬Support(L,Y)))
   where Body(L,Y) encodes the bodies of rules that could support the loop and Support(L,Y) blocks support that originates outside the loop. This definition preserves the intuitive “self‑support” condition of propositional loop formulas while handling quantification correctly.

2. Precise semantic correspondence – Two central theorems are proved.
   Theorem 1 states that for any first‑order theory T, the set of its stable models SM