Skip to main content
SpringerLink
Log in

To Vladimir Lifschitz on His 65th Birthday

  • Chapter
Book cover Correct Reasoning

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7265))

Abstract

I am honored to have been invited by the editors of this Festschrift to write an article in honor of Vladimir Lifschitz on the occasion of his 65th birthday. In this article I describe some of the major contributions that Vladimir has made in his exceptional career. I provide background material about Vladimir in the Former Soviet Union (FSU), where he was born; discuss his beginning years in the United States (US); how I became aware of his research; his work on stable models with Michael Gelfond, and some of my work in related areas; and describe some of the many contributions Vladimir has made in formalizing ad hoc approaches in artificial intelligence to a formal basis of logic-based analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., Blair, H.A., Walker, A.: Towards a Theory of Declarative Knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann Pub., Washington, D.C (1988)

    Chapter  Google Scholar 

  2. Borchert, P., Anger, C., Schaub, T., Truszczyński, M.: Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 3–7. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Bar-Hillel, Y., McCarthy, J., Selfridge, O.: Discussion of the paper: Programs with common sense. In: Lifschitz, V. (ed.) Formalizing Common Sense: Papers by John McCarthy, pp. 17–20. Ablex, London (1990)

    Google Scholar 

  4. Baral, C., Lobo, J., Minker, J.: Generalized Well-founded Semantics for Logic Programs. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 102–116. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  5. Baral, C., Subrahmanian, V.S.: Stable and Extension Class Theory for Logic Programs and Default Logics. Journal of Automated Reasoning 8(3), 345–366 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Colmerauer, A., Kanoui, H., Pasero, R., Roussel, P.: Un systeme de communication homme-machine en francais. Technical report, Groupe de Intelligence Artificielle Universitae de Aix-Marseille II, Marseille (1973)

    Google Scholar 

  7. Clark, K.L.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, New York (1978)

    Chapter  Google Scholar 

  8. Ferraris, P., Lifschitz, V.: Mathematical foundations of answer set programming. In: Artemov, S., Barringer, H., Avila Garcez, A.S., Lamb, L.C. (eds.) We Will Show Them! Essays in Honour of Dov Gabbay, vol. 1, pp. 615–664. King’s College Publications, London (2005)

    Google Scholar 

  9. Farris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Proceedings IJCAI 2007, pp. 372–379 (2007)

    Google Scholar 

  10. Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 189–208 (1971)

    Article  MATH  Google Scholar 

  11. Gelfond, M.: On Stratified Autoepistemic Theories. In: Proc. AAAI 1987, pp. 207–211 (1987)

    Google Scholar 

  12. Van Gelder, A.: Negation as Failure Using Tight Derivations for General Logic Programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 1149–1176. Morgan Kaufmann (1988)

    Google Scholar 

  13. Gelfond, M.: Answer sets in kr: a personal perspective. Association for Logic Programming 19(3) (2006)

    Google Scholar 

  14. Ginsberg, M.L. (ed.): Readings in Nonmonotonic Reasoning. Morgan Kaufmann Pub. (1987)

    Google Scholar 

  15. Gebser, M., Kaufmann, B., Schaub, T.: The Conflict-Driven Answer Set Solver clasp: Progress Report. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 509–514. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Proc. 5th International Conference and Symposium on Logic Programming, Seattle, Washington, August 15-19, pp. 1070–1080 (1988)

    Google Scholar 

  17. Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Proc. 5th International Conference on Logic Programming, pp. 579–597 (1990)

    Google Scholar 

  18. Gelfond, M., Lifschitz, V.: Representing action and change by logic programs. Journal of Logic Programming 17(2/3&4), 301–321 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  19. Gelfond, M., Lifschitz, V.: Action languages. Electronic Transactions on Artificial Intelligence 2, 193–210 (1998)

    MathSciNet  Google Scholar 

  20. Giunchiglia, E., Lifschitz, V.: An action language based on causal explanation: preliminary report. In: Proceedings AAAI 1998, pp. 623–630 (1998)

    Google Scholar 

  21. Gelfond, M., Lifschitz, V., Rabinov, A.: What are the limitations of the situation calculus? In: Boyer, R.S. (ed.) Automated Reasoning: Essays in Honor of Woody Bledsoe. Automated Reasoning Series, pp. 167–180. Kluwer Academic Publishers (1991)

    Google Scholar 

  22. Gallaire, H., Minker, J. (eds.): Logic and Databases. Plenum Press, New York (1978)

    Google Scholar 

  23. Van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded Sets and Well-founded Semantics for General Logic Programs. In: Proc. 7th Symposium on Principles of Database Systems, pp. 221–230 (1988)

    Google Scholar 

  24. Hanks, S., McDermott, D.: Default reasoning, nonmonotonic logics and the frame problem. In: AAAI, pp. 328–333 (1986)

    Google Scholar 

  25. Kuehner, D.: A Note on the Relation Between Resolution and Maslov’s Inverse Method. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence 6, pp. 73–76. American Elsevier Publishing Company (1971)

    Google Scholar 

  26. Lifschitz, V., Gelfond, M.: Compiling circumscriptive theories into logic programs. In: Proceedings AAAI-1988, pp. 455–459 (1988)

    Google Scholar 

  27. Lifschitz, V.: The efficiency of an algorithm of integer programming: a probabilistic analysis. Proceedings of the American Mathematical Society 79(1) (1980)

    Google Scholar 

  28. Lifschitz, B., Pittel, V.: The worst and the most probable performance of a class of set-covering algorithms. SIAM Journal of Computing 12(2), 329–346 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  29. Lifschitz, V.: Computing circumscription. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence 1985, pp. 121–127. Morgan Kaufmann (August 1985)

    Google Scholar 

  30. Lifschitz, V. (ed.): Mechanical Theorem Proving in the USSR: The Leningrad School. Delphic Associates, Falls Church, Virginia (1986)

    Google Scholar 

  31. Lifschitz, V.: Formal theories of action. In: Brown, F. (ed.) The Frame Problem in Artificial Intelligence. Morgan Kaufmann, San Mateo (1987)

    Google Scholar 

  32. Lifschitz, V.: On the semantics of STRIPS. In: Georgeff, M.P., Lansky, A.L. (eds.) Reasoning about Actions and Plans, San Mateo, California. Morgan Kaufmann (1987)

    Google Scholar 

  33. Lifschitz, V.: What is the inverse method? Journal of Automated Reasoning 5(1), 1–23 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  34. Lifschitz, V.: Circumscription. In: Gabbay, D., Hogger, C., Robinson, J. (eds.) Handbook of Logic in Logic Programming and Artificial Intelligence, vol. 3, pp. 89–148. Oxfrod University Press, Washington, D.C. (1993)

    Google Scholar 

  35. Lifschitz, V.: Inventing stable models: a personal perspective. Association for Logic Programming 19(3) (2006)

    Google Scholar 

  36. Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. MIT Press (1992)

    Google Scholar 

  37. Lifschitz, V., McCain, N., Remolina, E., Tacchella, A.: Getting to the airport: The oldest planning problem in AI. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, ch.7, pp. 157–165. Kluwer Academic Publishers, Boston (2000)

    Google Scholar 

  38. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (TOCL) 7(3) (2006)

    Google Scholar 

  39. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)

    Article  MathSciNet  Google Scholar 

  40. Lifschitz, V., Ren, W.: A modular action description language. In: Proceedings AAAI (2006)

    Google Scholar 

  41. Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings ICLP 1994, pp. 23–37 (1994)

    Google Scholar 

  42. Maslov, S.J.: Proof-Search Strategies for Methods of the Resolution Type. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence 6, pp. 77–90. American Elsevier Publishing Company (1971)

    Google Scholar 

  43. McCarthy, J.: Programs with common sense. Mechanization of Thought Processes 1 (1959)

    Google Scholar 

  44. McCarthy, J.: Situations, actions and causal laws (1963); Memo 2

    Google Scholar 

  45. McCarthy, J.: Circumscription - a form of non-monotonic reasoning. Artificial Intelligence 13(1 and 2), 27–39 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  46. Minker, J.: On Indefinite Databases and the Closed World Assumption. In: Loveland, D.W. (ed.) CADE 1982. LNCS, vol. 138, pp. 292–308. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  47. Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Pub. (1988)

    Google Scholar 

  48. Minker, J.: An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming 17(2, 3 and 4), 95–126 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  49. Minker, J.: Homage to Michael Gelfond on His 65th Birthday. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol. 6565, pp. 1–11. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  50. Minker, J.: Reminiscences on the anniversary of 30 years of nonmonotonic reasoning. In: Brewka, G., Marek, W., Truszczynski, M. (eds.) Nonmonotonic Reasoning. Essays Celebrating its 30th Anniversary, pp. 295–334. College Publications (2011); A volume of papers presented at NonMOn at 30 meeting, Lexington, KY, USA (October 2010)

    Google Scholar 

  51. Moore, R.C.: Semantical considerations on nonmonotonic logic. Artificial Intelligence 25(1), 75–94 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  52. Minker, J., Rajasekar, A.: A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming 9(1), 45–74 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  53. McCain, N., Turner, H.: Causal theories of action and change. In: AAAI/IAAI, pp. 460–465 (1997)

    Google Scholar 

  54. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3/4), 241–273 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  55. Niemelä, I., Simons, P.: Extending the Smodels system with cardinality and weight constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, ch.21, pp. 491–521. Kluwer Academic Publishers, Boston (2000)

    Google Scholar 

  56. Pearce, D.: A New Logical Characterization of Stable Models and Answer Sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS (LNAI), vol. 1216, pp. 57–70. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  57. Pearce, D.: Equilibrium logic. Annals of Mathematics and Artificial Intelligence 47, 3–41 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  58. Pearce, D.J.: Sixty Years of Stable Models. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, p. 52. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  59. Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programming. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, ch.5, pp. 193–216. Morgan Kaufmann Pub., Washington, D.C (1988)

    Google Scholar 

  60. Przymusinski, T.C.: Stationary semantics for disjunctive logic programs and deductive databases. In: Debray, S., Hermenegildo, M. (eds.) Proc. of the North American Conference on Logic Programming, Austin, Texas, pp. 40–62 (October 1990)

    Google Scholar 

  61. Reiter, R.: On Closed World Data Bases. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 55–76. Plenum Press, New York (1978)

    Chapter  Google Scholar 

  62. Reiter, R.: A Logic for Default Reasoning. Artificial Intelligence 13(1 and 2), 81–132 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  63. Reiter, R.: Knowledge In Action. The MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  64. Robinson, J.A.: A machine-oriented logic based on the resolution principle. J.ACM 12(1), 23–41 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  65. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Journal of Artificial Intelligence 138(1/2), 181–234 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  66. van Emden, M.H., Kowalski, R.A.: The Semantics of Predicate Logic as a Programming Language. J.ACM 23(4), 733–742 (1976)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland, 20742, USA

    Jack Minker

Authors
  1. Jack Minker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Natural Science, Sabanci University, Orhanli, 34956, Tuzla, Istanbul, Turkey

    Esra Erdem

  2. School of Computing, Informatics and Decision Systems Engineering, Arizona State University, P.O. Box 878809, 85287, Tempe, AZ, USA

    Joohyung Lee

  3. Department of Computer Science, University of Kentucky, 329 Rose Street, 40506, Lexington, KY, USA

    Yuliya Lierler

  4. Department of Artificial Intelligence, Politechnical University of Madrid, Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Spain

    David Pearce

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Minker, J. (2012). To Vladimir Lifschitz on His 65th Birthday. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds) Correct Reasoning. Lecture Notes in Computer Science, vol 7265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30743-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30743-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30742-3

  • Online ISBN: 978-3-642-30743-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation