A continuum of discrete systems

Annals of Mathematics and Artificial Intelligence

Volumn 21, Issue 2-4, 1997, Pages 153-186

  Blair, Howard A ^a   Chidella, Jagan ^a   Dushin, Fred ^a   Ferry, Audrey ^b   Humenn, Polar ^a  

^a SYRACUSE UNIVERSITY   (United States)

^b Computer Sciences Corporation ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21944445206     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018913302060     Document Type: Article

References (23)

1. 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.
2. 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).
3. K.R. Apt, Logic programming, in: Handbook of Theoretical Computer Science, ed. J. van Leeuwen (Elsevier, 1990) pp. 494-574.
4. M. Barnesly, Fractals Everywhere (Academic Press, 1993).
5. H.A. Blair, F. Dushin and P. Humenn, Simulations between programs as cellular automata, Technical Report SU-CIS-97-1. (Submitted.)
6. H.A. Blair, W. Marek and J. Schlipf, The expressiveness of locally stratified programs, Annals of Math. and AI 15 (1995) 209-229.
7. K. Falconer, Fractal Geometry (Wiley, 1990).
8. M. Fitting, A Kripke-Kleene semantics for logic programs, J. of Logic Programming (4) 1985 295-312.
9. M. Fitting, Tutorial on metric methods, in: 1993 International Symposium on Logic Programming, Vancouver, British Columbia (1993).
10. M. Fitting, Metric methods, three examples and a theorem, Journal of Logic Programming 21 (1994) 113-127.
11. M. Gardner, The fantastic combinations of John Conway's new solitaire game 'life', Scientific American 223(4) (April, 1970) 120-123.
12. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, 1979).
13. J. Jaffar and P.J. Stuckey, Canonical logic programs, Journal of Logic Programming 3(2) (1986) 143-155.
14. R. Jensen, Inner models and large cardinals, Bulletin of Symbolic Logic 1(4) (1995) 393-407.
15. J.L. Kelly, General Topology (Van Nostrand, 1955). Reprinted by Springer-Verlag, Graduate Texts in Mathematics, Vol. 27.
16. J.W. Lloyd, Foundations of Logic Programming, 2nd ed. (Springer-Verlag, 1987).
17. M. Mitchell, Computation in cellular automata: a selected review, Santa Fe Institute Working Paper 96-09-074 (1996).
18. A. Nerode and R. Shore, Logic for Applications (Springer-Verlag, 1993).
19. 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).
20. H. Rogers, Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).
21. J.C. Shepherdson, Unsolvable problems for SLDNF-resolution, Journal of Logic Programming 10(1) (1991) 19-22.
22. T. Toffoli and N. Margolis, Cellular Automata Machines: A New Environment for Modeling (MIT Press, 1987).
23. 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.