Lloyd-Topor completion and general stable models

Lloyd-Topor completion and general stable models

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory and practice of logic programming 2013-07, Vol.13 (4-5), p.503-515
Hauptverfasser: LIFSCHITZ, VLADIMIR, YANG, FANGKAI
Format: Artikel
Sprache:eng
Schlagworte:
Logic programming
Regular Papers
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068413000318