Bibliography
[Abramsky and Jung, 1994] Abramsky, S. and Jung, A. (1994). Domain theory. In Abramsky, S., Gabbay, D. M., and Maibaum, T. S., editors,
Handbook of Logic in Computer Science, Volume 3, pages 1–168. Oxford
University Press, Oxford, UK. An expanded and corrected version is
available at http://www.cs.bham.ac.uk/
∼ axj/papers.html.
[Albeverio et al., 1999] Albeverio, S., Khrennikov, A. Y., and Kloeden, P.
(1999). Memory retrieval as a p-adic dynamical system. Biosystems,
49:105–115.
[Antoniou, 1996] Antoniou, G. (1996). Non-Monotonic Reasoning. MIT
Press, Cambridge, MA.
[Apt, 1997] Apt, K. R. (1997). From Logic Programming to Prolog. International Series in Computer Science. Prentice Hall, Upper Saddle River,
NJ.
[Apt and Bezem, 1990] Apt, K. R. and Bezem, M. (1990). Acyclic programs.
In Warren, D. H. and Szeredi, P., editors, Proceedings of the Seventh
International Conference on Logic Programming, pages 617–633. MIT
Press, Cambridge, MA.
[Apt and Pedreschi, 1994] Apt, K. R. and Pedreschi, D. (1994). Modular termination proofs for logic and pure Prolog programs. In Levi, G., editor,
Advances in Logic Programming Theory, pages 183–229. Oxford University Press, Oxford, UK.
[Apt and Wallace, 2007] Apt, K. R. and Wallace, M. (2007). Constraint Logic
Programming Using Eclipse. Cambridge University Press, London; New
York.
[Apt et al., 1988] Apt, K. R., Blair, H. A., and Walker, A. (1988). Towards
a theory of declarative knowledge. In Minker, J., editor, Foundations
of Deductive Databases and Logic Programming, pages 89–148. Morgan
Kaufmann Publishers, Los Altos, CA.
[Arnold and Nivat, 1980a] Arnold, A. and Nivat, M. (1980a). Metric interpretations of infinite trees and semantics of non-deterministic recursive
programs. Theoretical Computer Science, 11:181–205.
243
[Abramsky and Jung, 1994] Abramsky, S. and Jung, A. (1994). Domain theory. In Abramsky, S., Gabbay, D. M., and Maibaum, T. S., editors,
Handbook of Logic in Computer Science, Volume 3, pages 1–168. Oxford
University Press, Oxford, UK. An expanded and corrected version is
available at http://www.cs.bham.ac.uk/
∼ axj/papers.html.
[Albeverio et al., 1999] Albeverio, S., Khrennikov, A. Y., and Kloeden, P.
(1999). Memory retrieval as a p-adic dynamical system. Biosystems,
49:105–115.
[Antoniou, 1996] Antoniou, G. (1996). Non-Monotonic Reasoning. MIT
Press, Cambridge, MA.
[Apt, 1997] Apt, K. R. (1997). From Logic Programming to Prolog. International Series in Computer Science. Prentice Hall, Upper Saddle River,
NJ.
[Apt and Bezem, 1990] Apt, K. R. and Bezem, M. (1990). Acyclic programs.
In Warren, D. H. and Szeredi, P., editors, Proceedings of the Seventh
International Conference on Logic Programming, pages 617–633. MIT
Press, Cambridge, MA.
[Apt and Pedreschi, 1994] Apt, K. R. and Pedreschi, D. (1994). Modular termination proofs for logic and pure Prolog programs. In Levi, G., editor,
Advances in Logic Programming Theory, pages 183–229. Oxford University Press, Oxford, UK.
[Apt and Wallace, 2007] Apt, K. R. and Wallace, M. (2007). Constraint Logic
Programming Using Eclipse. Cambridge University Press, London; New
York.
[Apt et al., 1988] Apt, K. R., Blair, H. A., and Walker, A. (1988). Towards
a theory of declarative knowledge. In Minker, J., editor, Foundations
of Deductive Databases and Logic Programming, pages 89–148. Morgan
Kaufmann Publishers, Los Altos, CA.
[Arnold and Nivat, 1980a] Arnold, A. and Nivat, M. (1980a). Metric interpretations of infinite trees and semantics of non-deterministic recursive
programs. Theoretical Computer Science, 11:181–205.
243