Bibliography
247
Topology and Applications, University of Southern Maine, Maine, USA,
August, 1996, Annals of the New York Academy of Sciences, pages 49–68.
New York Academy of Sciences, New York.
[Bornscheuer, 1996] Bornscheuer, S.-E. (1996). Rational models of normal
logic programs. In KI-96: Advances in Artificial Intelligence, Lecture
Notes in Artificial Intelligence, Volume 1137, pages 1–4. Springer, Berlin.
[Bouamama et al., 2000] Bouamama, S., Misane, D., and Priess-Crampe, S.
(2000). An application of ultrametric spaces in logic programming. In
Proceedings of the Sixth Maghrebian Conference on Computer Sciences.
Maghrebian Information Processing Society, Fes, Moroco.
[Bramer, 2010] Bramer, M. (2010). Logic Programming with Prolog. Springer,
Berlin.
[Buillame-Bert et al., 2010] Buillame-Bert, M., Broda, K., and d’Avila
Garcez, A. (2010). First-order logic learning in artificial neural networks.
In Proceedings IJCNN 2010. IEEE. In press.
[Bukatin, 2002] Bukatin, M. A. (2002). Mathematics of Domains. PhD thesis,
Brandeis University, Waltham, MA.
[Bukatin and Scott, 1997] Bukatin, M. A. and Scott, J. S. (1997). Towards
computing distances between programs via Scott domains. In Adian,
S. and Nerode, A., editors, Logical Foundations of Computer Science,
4th International Symposium, LFCS’97, Yaroslavl, Russia, July, 1997,
Proceedings, Lecture Notes in Computer Science, Volume 1234, pages 33–
43. Springer-Verlag, Berlin.
[Castro-Company et al., 2007] Castro-Company, F., Romaguera, S., S´ anchez´
Alvarez, J., and Tirado, P. (2007). A quasimetric lattice approach for
access prediction in replicated database protocols. Technical report, Instituto de Matem´ atica Pura y Aplicada, Universidad Polit´ ecnica de Valencia, Spain.
[Cavedon, 1989] Cavedon, L. (1989). Continuity, consistency, and completeness properties for logic programs. In Levi, G. and Martelli, M., editors,
Proceedings of the 6th International Conference on Logic Programming,
pages 571–584. MIT Press, Cambridge, MA.
[Cavedon, 1991] Cavedon, L. (1991). Acyclic programs and the completeness
of SLDNF-resolution. Theoretical Computer Science, 86:81–92.
[Cherchago et al., 2007] Cherchago, N., Hitzler, P., and H¨ olldobler, S. (2007).
Decidability under the well-founded semantics. In Marchiori, M., Pan,
J. Z., and de Sainte Marie, C., editors, Web Reasoning and Rule Systems,
First International Conference, RR 2007, Innsbruck , Austria, June 78, 2007, Proceedings, Lecture Notes in Computer Science, Volume 4524,
pages 269–278. Springer, Berlin.
247
Topology and Applications, University of Southern Maine, Maine, USA,
August, 1996, Annals of the New York Academy of Sciences, pages 49–68.
New York Academy of Sciences, New York.
[Bornscheuer, 1996] Bornscheuer, S.-E. (1996). Rational models of normal
logic programs. In KI-96: Advances in Artificial Intelligence, Lecture
Notes in Artificial Intelligence, Volume 1137, pages 1–4. Springer, Berlin.
[Bouamama et al., 2000] Bouamama, S., Misane, D., and Priess-Crampe, S.
(2000). An application of ultrametric spaces in logic programming. In
Proceedings of the Sixth Maghrebian Conference on Computer Sciences.
Maghrebian Information Processing Society, Fes, Moroco.
[Bramer, 2010] Bramer, M. (2010). Logic Programming with Prolog. Springer,
Berlin.
[Buillame-Bert et al., 2010] Buillame-Bert, M., Broda, K., and d’Avila
Garcez, A. (2010). First-order logic learning in artificial neural networks.
In Proceedings IJCNN 2010. IEEE. In press.
[Bukatin, 2002] Bukatin, M. A. (2002). Mathematics of Domains. PhD thesis,
Brandeis University, Waltham, MA.
[Bukatin and Scott, 1997] Bukatin, M. A. and Scott, J. S. (1997). Towards
computing distances between programs via Scott domains. In Adian,
S. and Nerode, A., editors, Logical Foundations of Computer Science,
4th International Symposium, LFCS’97, Yaroslavl, Russia, July, 1997,
Proceedings, Lecture Notes in Computer Science, Volume 1234, pages 33–
43. Springer-Verlag, Berlin.
[Castro-Company et al., 2007] Castro-Company, F., Romaguera, S., S´ anchez´
Alvarez, J., and Tirado, P. (2007). A quasimetric lattice approach for
access prediction in replicated database protocols. Technical report, Instituto de Matem´ atica Pura y Aplicada, Universidad Polit´ ecnica de Valencia, Spain.
[Cavedon, 1989] Cavedon, L. (1989). Continuity, consistency, and completeness properties for logic programs. In Levi, G. and Martelli, M., editors,
Proceedings of the 6th International Conference on Logic Programming,
pages 571–584. MIT Press, Cambridge, MA.
[Cavedon, 1991] Cavedon, L. (1991). Acyclic programs and the completeness
of SLDNF-resolution. Theoretical Computer Science, 86:81–92.
[Cherchago et al., 2007] Cherchago, N., Hitzler, P., and H¨ olldobler, S. (2007).
Decidability under the well-founded semantics. In Marchiori, M., Pan,
J. Z., and de Sainte Marie, C., editors, Web Reasoning and Rule Systems,
First International Conference, RR 2007, Innsbruck , Austria, June 78, 2007, Proceedings, Lecture Notes in Computer Science, Volume 4524,
pages 269–278. Springer, Berlin.