Abstract
We show how to regard covered logic programs as cellular automata. Covered logic programs are ones for which every variable occurring in the body of a given clause also occurs in the head of the same clause. We generalize the class of register machine programs to permit negative literals and characterize the members of this class of programs as n-state 2-dimensional cellular automata. We show how monadic covered programs, the class of which is computationally universal, can be regarded as 1-dimensional cellular automata. We show how to continuously (and differentiably) deform 1-dimensional cellular automata from one to another and understand the arrangement of these cellular automata in a separable Hilbert space over the real numbers. The embedding of the cellular automata of fixed radius r is a linear mapping into R2 2r+1 in which a cellular automaton's transition function is the attractor of a state-governed iterated function system of affine contraction mappings. The class of covered monadic programs having a particular fixed point has a uniform arrangement in an affine subspace of the Hilbert space l2. Furthermore, these programs are construable as almost everywhere continuous functions from the unit interval {x | 0 ≤ x ≤ 1} to the real numbers R. As one consequence, in particular, we can define a variety of natural metrics on the class of these programs. Moreover, for each program in this class, the set of initial segments of the program's fixed points, with respect to an ordering induced by the program's dependency relation, is a regular set.
Similar content being viewed by others
References
K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988) pp. 89–148.
S. Abramsky and A. Jung, Domain theory, in: Handbook of Logic in Computer Science, Vol. 3, eds. S. Abramsky, D.M. Gabbay and T.S.E. Maibaum (Oxford University Press, 1994).
K.R. Apt, Logic programming, in: Handbook of Theoretical Computer Science, ed. J. van Leeuwen (Elsevier, 1990) pp. 494–574.
M. Barnesly, Fractals Everywhere (Academic Press, 1993).
H.A. Blair, F. Dushin and P. Humenn, Simulations between programs as cellular automata, Technical Report SU-CIS-97-1. (Submitted.)
H.A. Blair, W. Marek and J. Schlipf, The expressiveness of locally stratified programs, Annals of Math. and AI 15 (1995) 209–229.
K. Falconer, Fractal Geometry (Wiley, 1990).
M. Fitting, A Kripke-Kleene semantics for logic programs, J. of Logic Programming (4) 1985 295–312.
M. Fitting, Tutorial on metric methods, in: 1993 International Symposium on Logic Programming, Vancouver, British Columbia (1993).
M. Fitting, Metric methods, three examples and a theorem, Journal of Logic Programming 21 (1994) 113–127.
M. Gardner, The fantastic combinations of John Conway's new solitaire game 'life', Scientific American 223(4) (April, 1970) 120–123.
J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, 1979).
J. Jaffar and P.J. Stuckey, Canonical logic programs, Journal of Logic Programming 3(2) (1986) 143–155.
R. Jensen, Inner models and large cardinals, Bulletin of Symbolic Logic 1(4) (1995) 393–407.
J.L. Kelly, General Topology (Van Nostrand, 1955). Reprinted by Springer-Verlag, Graduate Texts in Mathematics, Vol. 27.
J.W. Lloyd, Foundations of Logic Programming, 2nd ed. (Springer-Verlag, 1987).
M. Mitchell, Computation in cellular automata: a selected review, Santa Fe Institute Working Paper 96-09-074 (1996).
A. Nerode and R. Shore, Logic for Applications (Springer-Verlag, 1993).
T. Przymusinski, On the declarative semantics of deductive databases and logic programs, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988).
H. Rogers, Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).
J.C. Shepherdson, Unsolvable problems for SLDNF-resolution, Journal of Logic Programming 10(1) (1991) 19–22.
T. Toffoli and N. Margolis, Cellular Automata Machines: A New Environment for Modeling (MIT Press, 1987).
A. Van Gelder, Negation as failure using tight derivations for general logic programs, in: Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan Kaufmann, Los Altos, CA, 1988) pp. 149–176.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Blair, H.A., Chidella, J., Dushin, F. et al. A continuum of discrete systems. Annals of Mathematics and Artificial Intelligence 21, 153–186 (1997). https://doi.org/10.1023/A:1018913302060
Issue Date:
DOI: https://doi.org/10.1023/A:1018913302060