No abstract

We present cellular automata on appropriate digraphs and show that any covered normal logic program is a cellular automaton. Seeing programs a.s cellular automata. shifts attention from classes of Herbrand models to orbits of Herbra.nd interpretations. Orbits capture both the declarative, model-theoretic meaning of programs a.s well a.s 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 a.s cellular automata. Construing a. program a.s a cellular automaton leads to a general method for simulating any covered program with a. Horn clause program.

No abstract