Every Formula-Based Logic Program Has a Least Infinite-Valued Model
Every definite logic program has as its meaning a least Herbrand model with respect to the program-independent ordering \(\subseteq \). In the case of normal logic programs there do not exist least models in general. However, according to a recent approach by Rondogiannis and Wadge, who consider infinite-valued models, every normal logic program does have a least model with respect to a program-independent ordering. We show that this approach can be extended to formula-based logic programs (i.e., finite sets of rules of the form \(A\leftarrow \phi \) where \(A\) is an atom and \(\phi \) an arbitrary first-order formula). We construct for a given program \(P\) an interpretation \(M_P\) and show that it is the least of all models of \(P\).
KeywordsLogic programming Semantics of programs Negation-as-failure Infinite-valued logics Set theory
This work has been financed through a grant made available by the Carl Zeiss Foundation. The author is grateful to Prof. Dr. Peter Schroeder-Heister, Hans-Joerg Ant, M. Comp. Sc., and three anonymous reviewers for helpful comments and suggestions.
- 1.Jech, T.: Set Theory. The Third Millennium Edition, Revised and Expanded. Springer, Heidelberg (2002)Google Scholar
- 2.Przymusinski, T.: Every logic program has a natural stratification and an iterated least fixed point model. In: Eighth ACM Symposium on Principles of Database Systems, pp. 11–21 (1989)Google Scholar
- 4.Schroeder-Heister, P.: Rules of definitional reflection. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science (Montreal 1993), Los Alamitos, pp. 222–232 (1993)Google Scholar