Bibliography
249
[d’Avila Garcez et al., 2007] d’Avila Garcez, A. S., Lamb, L. C., and Gabbay,
D. M. (2007). Connectionist modal logic: Representing modalities in
neural networks. Theoretical Computer Science, 371(1):34–53.
[d’Avila Garcez et al., 2009] d’Avila Garcez, A. S., Lamb, L. C., and Gabbay,
D. M. (2009). Neural-Symbolic Cognitive Reasoning. Cognitive Technologies. Springer, Berlin.
[de Bakker, 2002] de Bakker, J. W. (2002). Fixed points in metric semantics.
Electronic Notes in Theoretical Computer Science, 40:70–71.
[de Bakker and de Vink, 1996] de Bakker, J. W. and de Vink, E. P. (1996).
Control Flow Semantics. Foundations of Computing Series. MIT Press,
Cambridge, MA.
[De Raedt et al., 2008] De Raedt, L., Frasconi, P., Kersting, K., and Muggleton, S., editors (2008). Probabilistic Inductive Logic Programming:
Theory and Applications. Springer-Verlag, Berlin.
[Dowling and Gallier, 1984] Dowling, W. F. and Gallier, J. H. (1984). Lineartime algorithms for testing the satisfiability of propositional Horn formulae. The Journal of Logic Programming, 1(3):267–284.
[Dragovich and Dragovich, 2006] Dragovich, B. and Dragovich, A. (2006). A
p-adic model of DNA sequence and genetic code. Preprint is available at
http://www.arxiv.org/abs/q-bio.GN/0607018.
[Dugundji and Granas, 1982] Dugundji, J. and Granas, A. (1982). Fixed
Point Theory. Monografie Matematyczne. Polish Scientific Publishers,
Warsaw.
[Dung and Kanchanasut, 1989] Dung, P. M. and Kanchanasut, K. (1989). A
fixpoint approach to declarative semantics of logic programs. In Lusk,
E. L. and Overbeek, R. A., editors, Logic Programming, Proceedings of
the North American Conference 1989, NACLP’89, Cleveland, Ohio, pages
604–625. MIT Press, Cambridge, MA.
[Edalat and Heckmann, 1998] Edalat, A. and Heckmann, R. (1998). A computational model for metric spaces. Theoretical Computer Science,
193:53–73.
[Fages, 1994] Fages, F. (1994). Consistency of Clark’s completion and the
existence of stable models. Journal of Methods of Logic in Computer
Science, 1:51–60.
[Ferry, 1994] Ferry, A. P. (1994). Topological Characterizations for Logic Programming Semantics. PhD thesis, University of Michigan, MI.
[Fitting, 1985] Fitting, M. C. (1985). A Kripke-Kleene semantics for general
logic programs. The Journal of Logic Programming, 2:295–312.
249
[d’Avila Garcez et al., 2007] d’Avila Garcez, A. S., Lamb, L. C., and Gabbay,
D. M. (2007). Connectionist modal logic: Representing modalities in
neural networks. Theoretical Computer Science, 371(1):34–53.
[d’Avila Garcez et al., 2009] d’Avila Garcez, A. S., Lamb, L. C., and Gabbay,
D. M. (2009). Neural-Symbolic Cognitive Reasoning. Cognitive Technologies. Springer, Berlin.
[de Bakker, 2002] de Bakker, J. W. (2002). Fixed points in metric semantics.
Electronic Notes in Theoretical Computer Science, 40:70–71.
[de Bakker and de Vink, 1996] de Bakker, J. W. and de Vink, E. P. (1996).
Control Flow Semantics. Foundations of Computing Series. MIT Press,
Cambridge, MA.
[De Raedt et al., 2008] De Raedt, L., Frasconi, P., Kersting, K., and Muggleton, S., editors (2008). Probabilistic Inductive Logic Programming:
Theory and Applications. Springer-Verlag, Berlin.
[Dowling and Gallier, 1984] Dowling, W. F. and Gallier, J. H. (1984). Lineartime algorithms for testing the satisfiability of propositional Horn formulae. The Journal of Logic Programming, 1(3):267–284.
[Dragovich and Dragovich, 2006] Dragovich, B. and Dragovich, A. (2006). A
p-adic model of DNA sequence and genetic code. Preprint is available at
http://www.arxiv.org/abs/q-bio.GN/0607018.
[Dugundji and Granas, 1982] Dugundji, J. and Granas, A. (1982). Fixed
Point Theory. Monografie Matematyczne. Polish Scientific Publishers,
Warsaw.
[Dung and Kanchanasut, 1989] Dung, P. M. and Kanchanasut, K. (1989). A
fixpoint approach to declarative semantics of logic programs. In Lusk,
E. L. and Overbeek, R. A., editors, Logic Programming, Proceedings of
the North American Conference 1989, NACLP’89, Cleveland, Ohio, pages
604–625. MIT Press, Cambridge, MA.
[Edalat and Heckmann, 1998] Edalat, A. and Heckmann, R. (1998). A computational model for metric spaces. Theoretical Computer Science,
193:53–73.
[Fages, 1994] Fages, F. (1994). Consistency of Clark’s completion and the
existence of stable models. Journal of Methods of Logic in Computer
Science, 1:51–60.
[Ferry, 1994] Ferry, A. P. (1994). Topological Characterizations for Logic Programming Semantics. PhD thesis, University of Michigan, MI.
[Fitting, 1985] Fitting, M. C. (1985). A Kripke-Kleene semantics for general
logic programs. The Journal of Logic Programming, 2:295–312.