Article contents
Lloyd-Topor completion and general stable models
Published online by Cambridge University Press: 25 September 2013
Abstract
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.
- Type
- Regular Papers
- Information
- Theory and Practice of Logic Programming , Volume 13 , Special Issue 4-5: 29th International Conference on Logic Programming , July 2013 , pp. 503 - 515
- Copyright
- Copyright © 2013 [VLADIMIR LIFSCHITZ and FANGKAI YANG]
References
- 2
- Cited by