# Lloyd-Topor Completion and General Stable Models

arXiv: https://arxiv.org/abs/1301.1394 · HTML: https://mlsanity.com/paper/1301.1394/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Jan 2013.

## Built on by (most cited first, 1 of 1)

- [Positive Dependency Graphs Revisited](https://mlsanity.com/paper/2207.08579/) (2022)

## Abstract (arXiv)

We investigate the relationship between the generalization of program completion defined in 1984 by Lloyd and Topor and the generalization of the stable model semantics introduced recently by Ferraris et al. The main theorem can be used to characterize, in some cases, the general stable models of a logic program by a first-order formula. The proof uses Truszczynski's stable model semantics of infinitary propositional formulas.