Homage to Michael Gelfond on His 65th Birthday

  • Jack Minker
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6565)


Michael Gelfond is one of the world leading scientists in the field of logic programming and nonmonotonic reasoning. This essay covers several aspects of Michael’s personal life, starting from his birth in the USSR, through his experiences in the USSR up to the time he emigrated to the United States (U.S.). This is followed by his first experiences in the U.S.: how he became involved in logic programming and nonmonotonic reasoning and some of his major scientific achievements. Michael is a warm, generous person, and I discuss his impact on some colleagues and students. In the concluding section, I observe that starting his career with impediments in the FSU, he overcame them to become one of the top computer scientists in logic programming and nonmonotonic reasoning.


Steklov Institute Logic Program Logic Programming Jewish Community Former Soviet Union 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Balduccini and Gelfond, 2001]
    Balduccini, M., Gelfond, M.: The Autonomous Agent Architecture. The Newsletter of the Association of Logic Programming 23 (2010)Google Scholar
  2. [Balduccini, Gelfond, and Nogueira, 2006]
    Balduccini, M., Gelfond, M., Nogueira, M.: Answer Set Based Design of Knowledge Systems. Ann. Math. Artif. Intell. 47(1-2), 183–219 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  3. [Baral and Gelfond, 1994]
    Baral, C., Gelfond, M.: Logic programming and knowledge representation. Journal of Logic Programming 19/20, 73–148 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [Baral, Gelfond, and Rushton, 2009]
    Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theory and Practice of Logic Programming 9(1), 57–144 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  5. [Baral and Gelfond, 2000]
    Baral, C., Gelfond, M.: Reasoning Agents in Dynamic Domains. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 257–279. Kluwer Academic Publishers, Dordrecht (2000)CrossRefGoogle Scholar
  6. [Eiter et al., 2000]
    Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative Problem- Solving Using The DLV System. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 79–103. Kluwer Academic Publishers, Boston (2000)CrossRefGoogle Scholar
  7. [Gebser et al., 2007]
    Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-Driven Answer Set Enumeration. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 136–148. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. [Gelfond, 2006]
    Gelfond, M.: Answer Sets in KR: a Personal Perspective. The Association for Logic Programming Newsletter 23 (2006)Google Scholar
  9. [Gelfond and Lifschitz, 1988]
    Gelfond, M., Lifschitz, V.: The stable model semantics for logic programs. In: Bowen, K., Kowalski, R. (eds.) Proc. 5th International Conference on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)Google Scholar
  10. [Gelfond and Lifschitz, 1990]
    Gelfond, M., Lifschitz, V.: Logic Programs with Classical Negation. In: Warren, D., Szeredi, P. (eds.) Proceedings of ICLP 1990, pp. 579–597. MIT Press, Cambridge (1990)Google Scholar
  11. [Gelfond and Lifschitz, 1991]
    Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)CrossRefzbMATHGoogle Scholar
  12. [Gelfond and Lifschitz, 1992]
    Gelfond, M., Lifschitz, V.: Representing actions in extended logic programs. In: Apt, K. (ed.) Joint International Conference and Symposium on Logic Programming, pp. 559–573. MIT Press, Cambridge (1992)Google Scholar
  13. [Gelfond and Lifschitz, 1993]
    Gelfond, M., Lifschitz, V.: Representing actions and change by logic programs. Journal of Logic Programming 17(2,3,4), 301–323 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  14. [Niemelä and Simons, 1997]
    Niemelä, I., Simons, P.: Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP. In: Proceedings of the 4th International Conference on on Logic Programming and Nonmonotonic Reasoning, pp. 421–430. Springer, Heidelberg (2003)Google Scholar
  15. [Pearce, 2008]
    Pearce, D.: Sixty years of Stable Models. In: Proceedings of the International Conference on Logic Programming, vol. 52 (2008)Google Scholar
  16. [Pearl, 1988]
    Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible Inference. Morgan Kaufmann, San Francisco (1988)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jack Minker
    • 1
  1. 1.Department of Computer ScienceUniversity of Maryland Institute for Advanced Computer StudiesCollege ParkUSA

Personalised recommendations