Bibliography
245
[Bartle, 1966] Bartle, R. G. (1966). The Elements of Integration. John Wiley
& Sons, New York.
[Batarekh, 1989] Batarekh, A. (1989). Topological Aspects of Logic Programming. PhD thesis, Syracuse University, Syracuse, New York.
[Batarekh and Subrahmanian, 1989a] Batarekh, A. and Subrahmanian, V. S.
(1989a). The query topology in logic programming. In Monien, B. and
Cori, R., editors, Proceedings of the 1989 Symposium on Theoretical Aspects of Computer Science, STACS 89, Paderborn, Germany, February,
1989, Lecture Notes in Computer Science, Volume 349, pages 375–387.
Springer, Berlin.
[Batarekh and Subrahmanian, 1989b] Batarekh, A. and Subrahmanian, V. S.
(1989b). Topological model set deformations in logic programming. Fundamenta Informaticae, 12(3):357–400.
[Belnap, 1977] Belnap, N. D. (1977). A useful four-valued logic. In Dunn,
J. M. and Epstein, G., editors, Modern Uses of Multiple-Valued Logic,
pages 5–37. Reidel, Dordrecht, The Netherlands.
[Berzati, 2007] Berzati, D. (2007). Non-Monotonic Reasoning: A Unified
Framework. Nova Science Publishers, New York.
[Bessaga, 1959] Bessaga, C. (1959). On the converse of the Banach fixed-point
principle. Colloquium Mathematicum, 7:41–43.
[Bezem, 1989] Bezem, M. (1989). Characterizing termination of logic programs with level mappings. In Lusk, E. L. and Overbeek, R. A., editors,
Proceedings of the North American Conference on Logic Programming,
pages 69–80. MIT Press, Cambridge, MA.
[Bidoit and Froideveaux, 1991] Bidoit, N. and Froideveaux, C. (1991). Negation by default and unstratifiable logic programs. Theoretical Computer
Science, 78:85–112.
[Bishop, 1995] Bishop, C. M. (1995). Neural Networks for Pattern Recognition. Oxford University Press, Oxford.
[Blair, 2007] Blair, H. A. (2007). Elementary differential calculus on discrete, continuous and hybrid spaces.
In Kopperman, R., Panangaden, P., Smyth, M. B., and Spreen, D., editors, Computational Structures for Modelling Space, Time and Causality, August, 2006, Volume
06341 of Dagstuhl Seminar Proceedings. Internationales Begegnungs- und
Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany.
[Blair and Remmel, 2001] Blair, H. A. and Remmel, J. (2001). Hybrid automata: Convergence spaces and continuity. In Proceedings of the Joint
IIIS & IEEE Meeting of the 5th World Multiconference on Systemics,
245
[Bartle, 1966] Bartle, R. G. (1966). The Elements of Integration. John Wiley
& Sons, New York.
[Batarekh, 1989] Batarekh, A. (1989). Topological Aspects of Logic Programming. PhD thesis, Syracuse University, Syracuse, New York.
[Batarekh and Subrahmanian, 1989a] Batarekh, A. and Subrahmanian, V. S.
(1989a). The query topology in logic programming. In Monien, B. and
Cori, R., editors, Proceedings of the 1989 Symposium on Theoretical Aspects of Computer Science, STACS 89, Paderborn, Germany, February,
1989, Lecture Notes in Computer Science, Volume 349, pages 375–387.
Springer, Berlin.
[Batarekh and Subrahmanian, 1989b] Batarekh, A. and Subrahmanian, V. S.
(1989b). Topological model set deformations in logic programming. Fundamenta Informaticae, 12(3):357–400.
[Belnap, 1977] Belnap, N. D. (1977). A useful four-valued logic. In Dunn,
J. M. and Epstein, G., editors, Modern Uses of Multiple-Valued Logic,
pages 5–37. Reidel, Dordrecht, The Netherlands.
[Berzati, 2007] Berzati, D. (2007). Non-Monotonic Reasoning: A Unified
Framework. Nova Science Publishers, New York.
[Bessaga, 1959] Bessaga, C. (1959). On the converse of the Banach fixed-point
principle. Colloquium Mathematicum, 7:41–43.
[Bezem, 1989] Bezem, M. (1989). Characterizing termination of logic programs with level mappings. In Lusk, E. L. and Overbeek, R. A., editors,
Proceedings of the North American Conference on Logic Programming,
pages 69–80. MIT Press, Cambridge, MA.
[Bidoit and Froideveaux, 1991] Bidoit, N. and Froideveaux, C. (1991). Negation by default and unstratifiable logic programs. Theoretical Computer
Science, 78:85–112.
[Bishop, 1995] Bishop, C. M. (1995). Neural Networks for Pattern Recognition. Oxford University Press, Oxford.
[Blair, 2007] Blair, H. A. (2007). Elementary differential calculus on discrete, continuous and hybrid spaces.
In Kopperman, R., Panangaden, P., Smyth, M. B., and Spreen, D., editors, Computational Structures for Modelling Space, Time and Causality, August, 2006, Volume
06341 of Dagstuhl Seminar Proceedings. Internationales Begegnungs- und
Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany.
[Blair and Remmel, 2001] Blair, H. A. and Remmel, J. (2001). Hybrid automata: Convergence spaces and continuity. In Proceedings of the Joint
IIIS & IEEE Meeting of the 5th World Multiconference on Systemics,