---
title: Semantic Element (SE) in Logic Programming
url: https://www.emergentmind.com/topics/semantic-element-se
type: topic
---

# Semantic Element (SE) in Logic Programming

A semantic element (SE), in the context of non-monotonic logic programming and answer-set programming (ASP), refers to the strong equivalence model, also known as the SE-model or Here-and-There model. SE-models provide a semantic, monotonic framework to characterize logic programs, capturing both their classical models and their answer sets, and determining when two programs are strongly equivalent (interchangeable in all contexts) [1306.3884][1102.5385].

## 1. Formal Definition and Construction of SE-Models

Let $A$ be a finite set of propositional atoms. An SE-interpretation is a pair $X = (I,J)$ with $I \subseteq J \subseteq A$. For a (possibly disjunctive) logic program $\Pi$, one defines its Gelfond–Lifschitz reduct relative to $J$ by
$$
\Pi^J = \{ H(r)^+ \leftarrow B(r)^+ \mid r \in \Pi, B(r)^- \subseteq J, B(r)^- \cap J = \emptyset \},
$$
where $H(r) = (H(r)^+,H(r)^-)$ and $B(r) = (B(r)^+,B(r)^-)$ are the positive and negative literals in the head and body of each rule $r$. An SE-model of $\Pi$ is an SE-interpretation $(I,J)$ such that $J \models \Pi$ and $I \models \Pi^J$. The set $\SE(\Pi)$ denotes all SE-models of $\Pi$.

These models yield the following properties:

- $\SE(\Pi)$ is monotonic in $\Pi$.
- $J$ is an answer set of $\Pi$ iff $(J,J) \in \SE(\Pi)$ and there is no $(I,J) \in \SE(\Pi)$ with $I \subsetneq J$.
- $\SE(\Pi) = \SE(\Pi')$ iff $\Pi$ and $\Pi'$ are strongly equivalent.

At the rule level, a rule $r$ over propositional alphabet $L$ has the form $H(r)^+; \neg H(r)^- \longleftarrow B(r)^+, \neg B(r)^-$. The SE-models of a rule are given via the above reduct-based satisfaction, providing canonical forms and fine control over equivalence classes [1102.5385].

## 2. SE-Models and Program Equivalence

Strong equivalence of logic programs is captured via SE-models. Programs $\Pi$ and $\Pi'$ are strongly equivalent iff $\SE(\Pi) = \SE(\Pi')$. At the rule level, two rules $r_1$ and $r_2$ are SE-equivalent if they have the same set of SE-models.

A key result is the existence of a unique *canonical rule* for each SE-equivalence class: every rule $r$ is SE-equivalent to exactly one canonical rule $\mathrm{can}(r)$, where canonical rules have disjoint positive/negative head/body sets with required constraints:
- $r$ is canonical if it is the tautology $\varepsilon$ or of the form $H^+; \neg H^- \longleftarrow B^+, \neg B^-$, with $H^+,H^-,B^+,B^-$ pairwise disjoint, and $H^- = \emptyset$ if $H^+ = \emptyset$.

The transformation to canonical form involves SE-preserving eliminations and reorganization, generating a unique representation for the SE-class [1102.5385].

## 3. Expressivity and Rule Representability

Not every set of SE-interpretations is representable as the set of SE-models of a single rule. The characterization theorem states that $\mathcal S \subseteq \{(I,J) \mid I \subseteq J \subseteq L\}$ is rule-representable if and only if its complement can be decomposed into unions of two convex sublattices in $(2^L, \subseteq)$:
$$
\left\{ (I,J) \mid I \in L_1 \land J \in L_2 \right\} \cup \left\{ (I,J) \mid J \in L_1 \cap L_2 \right\}.
$$
This lattice-theoretic condition precisely picks out the expressible sets and allows for constructing rules yielding required SE-models [1102.5385].

## 4. SE-Models in Program Update Frameworks

The Katsuno–Mendelzon (KM) postulates for belief update (BU1–BU8) can be restated for SE-models, supported by the monotonic and closure properties of SE-model sets. Program conjunction and disjunction are defined so that $\SE(\Pi \wedge \Gamma) = \SE(\Pi) \cap \SE(\Gamma)$ and $\SE(\Pi \vee \Gamma) = \SE(\Pi) \cup \SE(\Gamma)$, and "basic programs" (analogue to complete formulas) are those with exactly two SE-models $\{X, X^*\}$.

Eight postulates (P1–P8) for rule-update operators on SE-models directly lift the KM update axioms. The representation theorem then states that any operator satisfying these postulates corresponds to a family of (semi-)faithful and organized preorder assignments $\preceq^X$ on SE-interpretations, such that
$$
\SE(\Pi \oplus \Gamma) = \bigcup_{X \in \SE(\Pi)} \min(\SE(\Gamma), \preceq^X).
$$
A concrete example is the "Winslett-style" update, where the preference on SE-models minimizes change first in the second component ($L$) and then, if tied, in the first ($K$). Formally,
$$
(K_1, L_1) \preceq^X_w (K_2, L_2) \iff (L_1 \ominus J) \subseteq (L_2 \ominus J) \land ((L_1 \ominus J) = (L_2 \ominus J) \implies (K_1 \ominus I)\setminus \Delta \subseteq (K_2 \ominus I)\setminus \Delta )
$$
with $\Delta = L_1 \ominus J$. This operator requires determining all minimal changes, introducing computational complexity [1306.3884].

## 5. Computational Complexity and Limitations

Deciding, for the Winslett-style SE update operator $\oplus_w$, the entailment $\Pi \oplus_w \Gamma \models_{SE} \Theta$ (i.e., whether every SE-model of the update is an SE-model of $\Theta$) is $\Pi^P_2$-complete in the general case, even for positive facts and non-disjunctive $\Gamma$ and single fact $\Theta$. For definite (Horn) programs, the problem is co-NP-complete [1306.3884].

A fundamental issue arises for all SE-model based update operators satisfying strong syntax-independence (P4). They must violate at least one of two basic properties:
1. **Dynamic support**: Every atom $p$ in an answer set after update should be supported by some rule in the union of original and update programs.
2. **Fact update**: Updates between consistent sets of facts should reflect database-style literal inertia.

An explicit example shows this violation: two programs with identical SE-models, but different syntactic support for an atom in the answer set. Any fully semantic, AGM/KM–style update operator on SE-models necessarily loses either support or the fact update property [1306.3884].

## 6. SE-Model Induced Notions of Program Equivalence

In addition to strong equivalence ($\equiv_S$) and strong update equivalence ($\equiv_{SU}$), SE-model semantics give rise to further notions:
- **Strong Rule equivalence ($\equiv_{SR}$)**: Two programs are SR-equivalent if their rule SE-model sets coincide (modulo tautology).
- **Strong Minimal Rule equivalence ($\equiv_{SMR}$)**: Minimal elements (under set inclusion) of their rule SE-model sets coincide.

These form a strict refinement hierarchy: $\equiv_{SU} \succ \equiv_{SR} \succ \equiv_{SMR} \succ \equiv_{S}$. Concrete examples distinguish between these, highlighting that the traditional strong equivalence is strictly weaker than the distinctions available when the full SE-model structure of rules is considered [1102.5385].

| Equivalence Type           | Condition                                      | Comparative Strength     |
|---------------------------|------------------------------------------------|-------------------------|
| Strong Update ($\equiv_{SU}$) | SE-tautological difference in updates        | Strongest               |
| Strong Rule ($\equiv_{SR}$)   | Same sets of rule SE-models                  |                         |
| Strong Minimal Rule ($\equiv_{SMR}$) | Same minimal rule SE-model sets              |                         |
| Strong Equivalence ($\equiv_S$)      | Identical SE-model sets                    | Weakest                 |

## 7. Significance and Limitations of the SE-Model Semantic Approach

SE-models enable a uniform, monotonic, and semantic framework extending stable model semantics to characterize strong equivalence, program updates, and rule expressivity in non-monotonic logic programming. They provide a foundation for lifting classical belief-change and update methodologies (notably AGM and KM frameworks) into the non-monotonic setting, with representation theorems precisely characterizing the space of update operators that satisfy semantic postulates.

However, SE-model–based approaches, in their pure semantic and syntax-independent versions, necessarily lose certain pragmatic properties fundamental in answer-set programming, such as dynamic support and the realistic handling of fact updates. This suggests that to restore such properties, either more expressive semantic frameworks (beyond Here-and-There) or approaches re-integrating syntactic information are required [1306.3884]. The transition from program syntax to pure semantic content, while theoretically clean, entails unavoidable tradeoffs in the behavior of updates and equivalence notions.

## References

- "The Rise and Fall of Semantic Rule Updates Based on SE-Models" [1306.3884]
- "Back and Forth Between Rules and SE-Models (Extended Version)" [1102.5385]

Source: https://www.emergentmind.com/topics/semantic-element-se