Abstract
We discuss a revision method for normal logic programs that do not have a stable model. The method we propose is a revision-by-transformation method: we apply some rule transformations which do not affect the meaning of such a program as a first-order theory, but ensure that the transformed program has at least one stable model.
The stable models of such a transformation are called the nearly-stable models of the original program.
The transformation method we propose is a generalization of program transformation approaches as shift operations and dependency-directed backtracking which can be shown to be too weak to provide a suitable model for every normal logic program.
Furthermore, our results can be used to extend the weakly-stable model semantics as recently proposed by Schaerf ([Sch93]).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Doyle. A truth maintenance system. Artificial Intelligence, 12, 1979.
C. G. Fermüller G. Gottlob. Removing redundancy from a clause. Artificial Intelligence, 61:263–289, 1993.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Fifth International Conference Symposium on Logic Programming, pages 1070–1080, 1988.
L. Giordano and A. Martelli. Generalized stable models, truth maintenance and conflict resolution. In D. Warren and P. Szeredi, editors, Proceedings of the 7th International Conference on Logic Programming, pages 427–441, 1990.
G. Gottlob J. Dix and V. Marek. Causal models of disjunctive logic programs. In Proceedings of the Tenth International Conference on Logic Programming ICLP'94, 1994.
J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, Heidelberg, 1987.
V. W. Marek and M. Truszczyński. Nonmonotonic Logic. Springer Verlag, Heidelberg, 1993.
M. Schaerf. Negation and minimality in non-horn databases. In C. Beeri, editor, Proceedings of the Twelfth Conference on Principles of Database Systems (PODS-93), pages 147–157. ACM-Press, 1993.
C. Witteveen and G. Brewka. Skeptical reason maintenance and belief revision. Artificial Intelligence, 61:1–36, 1993.
C. Witteveen. Shifting and condensing normal logic programs and disjunctive databases. Technical Report TWI 94-100, Delft University, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witteveen, C. (1995). Every normal program has a nearly-stable model. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Non-Monotonic Extensions of Logic Programming. NMELP 1994. Lecture Notes in Computer Science, vol 927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030660
Download citation
DOI: https://doi.org/10.1007/BFb0030660
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59467-3
Online ISBN: 978-3-540-49272-6
eBook Packages: Springer Book Archive