Abstract
We consider operators working on lattices of interpretations of logic programs. Operators defined by programs are called algorithmic. Some properties of algorithmic operators, such as monotonicity and compactness, are used to define fix-point semantics. But what are necessary and sufficient conditions for such operators? The main result of this paper may be formulated, roughly speaking, as follows: an operator is algorithmic, iff its result on a given interpretation is the sum of its results on finite and restricted parts of this interpretation, i.e., is in essence defined by a certain algebra. This condition, which we called as n,k-truncateness of an operator, may be divided into several simpler conditions dealing with the generalisation of the notion of monotonicity and with the “breadth” n (the maximum number of terms) and the “height” k (the maximum height of terms) of subsystems which form the result of the operator.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Borshchev, V.B. and Khomyakov, M.V. (1972) Schemes for Functions and Relations. Workshop on Automatic Processing of Texts of Natural Languages. Yerevan, (The same text in Investigations in formalized languages and nonclassical logics, Moscow, Nauka 1974, 23–49). (in Russian).
Borshchev, V.B. and Khomyakov, M.V. (1976) Club systems. Nauchno-Tekhnicheskaya Informatsia, Seriya 2, 8, 3–6 (in Russian).
Borshchev, V.B. (1986) Logic programming. Tekhnicheskaya kibernetika, 2, 89–109, (in Russian).
Colmerauer A., Kanoui H., van Caneghem M. (1983) Prolog, bases theoriques et developpements actuels. Technique et Science Informatiques, 4. 277–311.
Kolmogerov, A.N. and Uspenskl, V.A. (1957) To the Definition of Algorithm. Uspekhi Matematicheskikh Nauk., 13, 4 3–28, (in Russian).
Lloyd J.W. (1984) Foundations of logic programming. Springer Verlag, 124p.
Turing, A.M. (1936) On Computable Numbers, with an Application to the Entsheidungproblem. Proc. London Math. Soc. Ser. 2, 42, 3–4 230–265.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borshchev, V.B. (1992). Properties of algorithmic operators. In: Voronkov, A. (eds) Logic Programming. Lecture Notes in Computer Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55460-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-55460-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55460-8
Online ISBN: 978-3-540-47083-0
eBook Packages: Springer Book Archive