Simulations between programs as cellular automata

Abstract

We present cellular automata on appropriate digraphs and show that any covered normal logic program is a cellular automaton. Seeing programs as cellular automata shifts attention from classes of Herbrand models to orbits of Herbrand interpretations. Orbits capture both the declarative, model-theoretic meaning of programs as well as their inferential behavior. Logically and intentionally different programs can produce orbits that simulate each other. Simple examples of such behavior are compellingly exhibited with space-time diagrams of the programs as cellular automata. Constnfing a program as a cellular automaton leads to a general method for simulating any covered program with a Horn clause program. This means that orbits of Horn programs are completely representative of orbits of covered normal programs.