258
Bibliography
[Leone et al., 2006] Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G.,
Perri, S., and Scarcello, F. (2006). The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic,
7(3):499–562.
[Lifschitz, 1999] Lifschitz, V. (1999). Answer set planning. In Schreye, D. D.,
editor, Logic Programming. Proceedings of the 16th International Conference on Logic Programming, ICLP’99, Las Cruces, New Mexico, November, 1999, pages 23–37. MIT Press, Cambridge, MA.
[Lifschitz, 2001] Lifschitz, V. (2001). Success of default logic. In Hayes, P.,
Sandewall, E., Amarel, S., et al., editors, Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter, pages 208–212.
Springer-Verlag, New York, Secaucus, NJ.
[Lifschitz et al., 1995] Lifschitz, V., McCain, N., Przymusinski, T. C., and
St¨ ark, R. F. (1995). Loop checking and the well-founded semantics. In
Marek, V. W. and Nerode, A., editors, Logic Programming and NonMonotonic Reasoning, Proceedings of the 3rd International Conference,
LPNMR’95, Lexington, KY, USA, June 1995, Lecture Notes in Computer
Science, Volume 928, pages 127–142. Springer, Berlin.
[Lloyd, 1987] Lloyd, J. W. (1987). Foundations of Logic Programming, Second
Edition. Springer, Berlin.
[Makinson, 2005] Makinson, D. (2005). Bridges from Classical to NonMonotonic Logic. King’s College Publications, London.
[Marchiori, 1996] Marchiori, E. (1996). On termination of general logic programs with respect to constructive negation. The Journal of Logic Programming, 26(1):69–89.
[Marek and Truszczy´ nski, 1999] Marek, V. W. and Truszczy´ nski, M. (1999).
Stable models and an alternative logic programming paradigm. In Apt,
K. R., Marek, V. W., Truszczy´ nski, M., and Warren, D. S., editors, The
Logic Programming Paradigm: A 25-Year Perspective, pages 375–398.
Springer, Berlin.
[Markowsky, 1976] Markowsky, G. (1976). Chain-complete posets and directed sets with applications. Algebra Universalis, 6:53–68.
[Martin, 2000] Martin, K. (2000). A Foundation for Computation. PhD thesis, Department of Mathematics, Tulane University, New Orleans, LA.
[Martinetz and Schulten, 1991] Martinetz, T. and Schulten, K. (1991). A
“Neural-Gas” network learns topologies. Artificial Neural Networks,
I:397–402.
Bibliography
[Leone et al., 2006] Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G.,
Perri, S., and Scarcello, F. (2006). The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic,
7(3):499–562.
[Lifschitz, 1999] Lifschitz, V. (1999). Answer set planning. In Schreye, D. D.,
editor, Logic Programming. Proceedings of the 16th International Conference on Logic Programming, ICLP’99, Las Cruces, New Mexico, November, 1999, pages 23–37. MIT Press, Cambridge, MA.
[Lifschitz, 2001] Lifschitz, V. (2001). Success of default logic. In Hayes, P.,
Sandewall, E., Amarel, S., et al., editors, Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter, pages 208–212.
Springer-Verlag, New York, Secaucus, NJ.
[Lifschitz et al., 1995] Lifschitz, V., McCain, N., Przymusinski, T. C., and
St¨ ark, R. F. (1995). Loop checking and the well-founded semantics. In
Marek, V. W. and Nerode, A., editors, Logic Programming and NonMonotonic Reasoning, Proceedings of the 3rd International Conference,
LPNMR’95, Lexington, KY, USA, June 1995, Lecture Notes in Computer
Science, Volume 928, pages 127–142. Springer, Berlin.
[Lloyd, 1987] Lloyd, J. W. (1987). Foundations of Logic Programming, Second
Edition. Springer, Berlin.
[Makinson, 2005] Makinson, D. (2005). Bridges from Classical to NonMonotonic Logic. King’s College Publications, London.
[Marchiori, 1996] Marchiori, E. (1996). On termination of general logic programs with respect to constructive negation. The Journal of Logic Programming, 26(1):69–89.
[Marek and Truszczy´ nski, 1999] Marek, V. W. and Truszczy´ nski, M. (1999).
Stable models and an alternative logic programming paradigm. In Apt,
K. R., Marek, V. W., Truszczy´ nski, M., and Warren, D. S., editors, The
Logic Programming Paradigm: A 25-Year Perspective, pages 375–398.
Springer, Berlin.
[Markowsky, 1976] Markowsky, G. (1976). Chain-complete posets and directed sets with applications. Algebra Universalis, 6:53–68.
[Martin, 2000] Martin, K. (2000). A Foundation for Computation. PhD thesis, Department of Mathematics, Tulane University, New Orleans, LA.
[Martinetz and Schulten, 1991] Martinetz, T. and Schulten, K. (1991). A
“Neural-Gas” network learns topologies. Artificial Neural Networks,
I:397–402.