Abstract
Using a technique of successive approximations, conditions were derived under which such approximations converge to a fixpoint. In such cases, the limit of a sequence of approximations provides a mathematically computable fixpoint for non-monotone maps. In this paper, we define a class of logic programs for which such a technique provides a way of constructing a minimal fixpoint with special properties—stable model, preferable to any other minimal fixpoint. Unlike stratified programs, the class of programs we present has the advantage of allowing negation through recursion. We also present some results on unique fixpoints in non-monotone maps.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Apt, K., Blair, H., Walker, A. (1988) Towards a Theory of Declarative Knowledge, in: Foundations of Logic Programming and Deductive Databases (ed. Jack Minker), pps 89–148, Morgan Kaufmann.
Batarekh, A., (1989) Topological Aspects of Logic Programming, (1989), PhD thesis, Syracuse University, Syracuse, NY.
Batarekh, A., (1989) Convergence and Fixed-Points of Non Monotone Maps, Proc. of North American Logic Programming Conference 89, pps 257–273.
Batarekh, A., Subrahmanian, V.S. (1988) A T 4-Space of Models of Logic Programs and Their Completions, Part I: Foundations, Tech. Report LPRG-TR-88-15, Syracuse University.
Batarekh A., Subrahmanian, V.S., (1989) Topological Model Set Deformations in Logic Programming, Fundamenta Informatica, Vol XII, no. 3, pps 357–400.
Birkhoff G., (1948) Lattice Theory, American Mathematical Society.
Fitting, M., (1985), A Kripke-Kleene Semantics for Logic Programs, J. Logic Programming, 4 pps 295–312.
Gelfond M., Lifschitz V., (1988), The Stable Model Semantics for Logic Programming, Proc. of Fifth International Conference and Symposium on Logic Programming, pps. 1070–1080.
Guessarian I., (1987), Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science, Fundamenta Informatica X pps. 387–414.
Lloyd, J.W. (1984) Foundations of Logic Programming, Springer-Verlag.
Przymuszinski, T. (1988) On the Declarative Semantics of Deductive Databases and Logic Programs, in: Foundations of Deductive Databases and Logic Programming (ed. Jack Minker), pps 193–216, Morgan Kauffman.
Simmons,G. F., (1963) Topology and Modern Analysis, McGraw Hill.
Tarski, A., (1955), A Lattice Theoretic Fixpoint Theorem and its Applications, Pacific J. of Math. 5 pps 285–309.
Van Gelder, A., Ross K., Schlipf, J.S. (1988), Unfounded Sets and Well-Founded Semantics for General Logic Programs, Proc. Symposium on Principles of Database Systems, pps. 221–230.
Vulikh B. Z., (1967) Introduction to the Theory of Partially Ordered Sets, Wolters-Noordhoff.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Batarekh, A. (1990). Fixpoint techniques for non-monotone maps. In: Kirchner, H., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1990. Lecture Notes in Computer Science, vol 463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53162-9_35
Download citation
DOI: https://doi.org/10.1007/3-540-53162-9_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53162-3
Online ISBN: 978-3-540-46738-0
eBook Packages: Springer Book Archive