The s-semantics makes it possible to explicitly deal with variables in program answers. So it seems suitable for programs using nonground data structures, like open lists. However it is difficult to find examples of using the s-semantics to reason about particular programs. Here we apply s-semantics to prove correctness and completeness of Fr\"uhwirth's $n$ queens program. This is compared with a proof, published elsewhere, based on the standard semantics and Herbrand interpretations.

中文翻译：

---

S-语义——一个例子

s 语义使明确处理程序答案中的变量成为可能。所以它似乎适用于使用非基础数据结构的程序，比如开放列表。然而，很难找到使用 s 语义来推理特定程序的示例。在这里，我们应用 s 语义来证明 Fr\"uhwirth 的 $n$ 皇后程序的正确性和完整性。这与基于标准语义和 Herbrand 解释的其他地方发表的证明进行了比较。