The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vladimir Lifschitz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Gelfond, Vladimir Lifschitz
    The Stable Model Semantics for Logic Programming. [Citation Graph (58, 0)][DBLP]
    ICLP/SLP, 1988, pp:1070-1080 [Conf]
  2. Michael Gelfond, Vladimir Lifschitz
    Logic Programs with Classical Negation. [Citation Graph (9, 0)][DBLP]
    ICLP, 1990, pp:579-597 [Conf]
  3. Vladimir Lifschitz
    Computing Circumscription. [Citation Graph (4, 0)][DBLP]
    IJCAI, 1985, pp:121-127 [Conf]
  4. Michael Gelfond, Vladimir Lifschitz
    Classical Negation in Logic Programs and Disjunctive Databases. [Citation Graph (4, 0)][DBLP]
    New Generation Comput., 1991, v:9, n:3/4, pp:365-386 [Journal]
  5. Vladimir Lifschitz
    Pointwise Circumscription: Preliminary Report. [Citation Graph (3, 0)][DBLP]
    AAAI, 1986, pp:406-410 [Conf]
  6. Enrico Giunchiglia, Vladimir Lifschitz
    An Action Language Based on Causal Explanation: Preliminary Report. [Citation Graph (1, 0)][DBLP]
    AAAI/IAAI, 1998, pp:623-630 [Conf]
  7. Vladimir Lifschitz, Hudson Turner
    Splitting a Logic Program. [Citation Graph (1, 0)][DBLP]
    ICLP, 1994, pp:23-37 [Conf]
  8. Vladimir Lifschitz
    Logical Foundations of Deductive Databases. [Citation Graph (1, 0)][DBLP]
    IFIP Congress, 1989, pp:315-321 [Conf]
  9. Vladimir Lifschitz
    Toward a Metatheory of Action. [Citation Graph (1, 0)][DBLP]
    KR, 1991, pp:376-386 [Conf]
  10. Michael Gelfond, Vladimir Lifschitz
    Compiling Circumscriptive Theories into Logic Programs. [Citation Graph (1, 0)][DBLP]
    NMR, 1988, pp:74-99 [Conf]
  11. Vladimir Lifschitz
    Closed-World Databases and Circumscription. [Citation Graph (1, 0)][DBLP]
    Artif. Intell., 1985, v:27, n:2, pp:229-235 [Journal]
  12. Michael Gelfond, Vladimir Lifschitz
    Representing Action and Change by Logic Programs. [Citation Graph (1, 0)][DBLP]
    J. Log. Program., 1993, v:17, n:2/3&4, pp:301-321 [Journal]
  13. Michael Gelfond, Vladimir Lifschitz
    Compiling Circumscriptive Theories into Logic Programs. [Citation Graph (0, 0)][DBLP]
    AAAI, 1988, pp:455-449 [Conf]
  14. Vladimir Lifschitz
    Circumscriptive Theories: A Logic-based Framework for Knowledge Representation (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    AAAI, 1987, pp:364-368 [Conf]
  15. Vladimir Lifschitz
    Restricted Monotonicity. [Citation Graph (0, 0)][DBLP]
    AAAI, 1993, pp:432-437 [Conf]
  16. Vladimir Lifschitz, Wanwan Ren
    A Modular Action Description Language. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  17. Joohyung Lee, Vladimir Lifschitz
    Additive Fluents. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  18. Vladimir Lifschitz
    What is a Logic Program. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2005, pp:- [Conf]
  19. Paolo Ferraris, Vladimir Lifschitz
    Mathematical Foundations of Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:615-664 [Conf]
  20. Michael Gelfond, Vladimir Lifschitz, Arkady Rabinov
    What are the Limitations of the Situation Calculus? [Citation Graph (0, 0)][DBLP]
    Automated Reasoning: Essays in Honor of Woody Bledsoe, 1991, pp:167-180 [Conf]
  21. Esra Erdem, Vladimir Lifschitz, Martin D. F. Wong
    Wire Routing and Satisfiability Planning. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:822-836 [Conf]
  22. Esra Erdem, Vladimir Lifschitz
    Fages' Theorem for Programs with Nested Expressions. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:242-254 [Conf]
  23. Selim T. Erdogan, Vladimir Lifschitz
    Definitions in Answer Set Programming: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:483-484 [Conf]
  24. Michael Gelfond, Vladimir Lifschitz
    Representing Actions in Extended Logic Programming. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1992, pp:559-573 [Conf]
  25. Joohyung Lee, Vladimir Lifschitz
    Loop Formulas for Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:451-465 [Conf]
  26. Vladimir Lifschitz
    SLDNF, Constructive Negation and Grounding. [Citation Graph (0, 0)][DBLP]
    ICLP, 1995, pp:581-595 [Conf]
  27. Vladimir Lifschitz
    Answer Set Planning. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:23-37 [Conf]
  28. Enrico Giunchiglia, Vladimir Lifschitz
    Dependent Fluents. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1964-1969 [Conf]
  29. G. Neelakantan Kartha, Vladimir Lifschitz
    A Simple Formalization of Actions Using Circumscription. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1970-1977 [Conf]
  30. Joohyung Lee, Vladimir Lifschitz
    Describing Additive Fluents in Action Language C+. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1079-1084 [Conf]
  31. Vladimir Lifschitz
    Formal Theories of Action (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    IJCAI, 1987, pp:966-972 [Conf]
  32. Vladimir Lifschitz
    Nonmonotonic Databases and Epistemic Queries. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:381-386 [Conf]
  33. Vladimir Lifschitz, Arkady Rabinov
    Things That Change by Themselves. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:864-867 [Conf]
  34. Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
    A New Perspective on Stable Models. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:372-379 [Conf]
  35. Selim T. Erdogan, Vladimir Lifschitz
    Actions as Special Cases. [Citation Graph (0, 0)][DBLP]
    KR, 2006, pp:377-388 [Conf]
  36. David W. Etherington, Kenneth D. Forbus, Matthew L. Ginsberg, David J. Israel, Vladimir Lifschitz
    Critical Issues in Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    KR, 1989, pp:500-504 [Conf]
  37. Michael Gelfond, Halina Przymusinska, Vladimir Lifschitz, Miroslaw Truszczynski
    Disjective Defaults. [Citation Graph (0, 0)][DBLP]
    KR, 1991, pp:230-237 [Conf]
  38. G. Neelakantan Kartha, Vladimir Lifschitz
    Actions with Indirect Effects (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    KR, 1994, pp:341-350 [Conf]
  39. Vladimir Lifschitz
    Situation Calculus and Causal Logic. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:536-546 [Conf]
  40. Vladimir Lifschitz, Thomas Y. C. Woo
    Answer Sets in General Nonmonotonic Reasoning (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    KR, 1992, pp:603-614 [Conf]
  41. Vladimir Lifschitz
    Missionaries and Cannibals in the Causal Calculator. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:85-96 [Conf]
  42. Vladimir Lifschitz
    Between Circumscription and Autoepistemic Logic. [Citation Graph (0, 0)][DBLP]
    KR, 1989, pp:235-244 [Conf]
  43. Vladimir Lifschitz
    The Mathematics of Nonmonotonic Reasoning (Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:242- [Conf]
  44. Esra Erdem, Vladimir Lifschitz
    Transformations of Logic Programs Related to Causality and Planning. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:107-116 [Conf]
  45. Semra Dogandag, Paolo Ferraris, Vladimir Lifschitz
    Almost Definite Causal Theories. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:74-86 [Conf]
  46. Vladimir Lifschitz
    Answer Set Planning (Abstract). [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:373-374 [Conf]
  47. Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk
    Loop Checking and the Wll-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1995, pp:127-142 [Conf]
  48. Vladimir Lifschitz, Grigori Schwarz
    Extended Logic Programs as Autoepistemic Theories. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1993, pp:101-114 [Conf]
  49. Vladimir Lifschitz, Hudson Turner
    Representing Transition Systems by Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:92-106 [Conf]
  50. Vladimir Lifschitz, David Pearce, Agustín Valverde
    A Characterization of Strong Equivalence for Logic Programs with Variables. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:188-200 [Conf]
  51. Vladimir Lifschitz, Hudson Turner
    From Disjunctive Programs to Abduction. [Citation Graph (0, 0)][DBLP]
    NMELP, 1994, pp:23-42 [Conf]
  52. Vladimir Lifschitz
    Why Sam doesn't know calculus. [Citation Graph (0, 0)][DBLP]
    NMR, 2002, pp:5- [Conf]
  53. Vladimir Lifschitz
    Some Results on Circumscription. [Citation Graph (0, 0)][DBLP]
    NMR, 1984, pp:151-164 [Conf]
  54. Vladimir Lifschitz
    Benchmark Problems for Formal Non-Monotonic Reasoning, Version 2.00. [Citation Graph (0, 0)][DBLP]
    NMR, 1988, pp:202-219 [Conf]
  55. Esra Erdem, Vladimir Lifschitz, Luay Nakhleh, Donald Ringe
    Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    PADL, 2003, pp:160-176 [Conf]
  56. Vladimir Lifschitz, Norman McCain, Hudson Turner
    Automated Reasoning About Actions: A Logic Programming Approach. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:641- [Conf]
  57. Michael Gelfond, Vladimir Lifschitz, Halina Przymusinska, Grigori Schwarz
    Autoepistemic Logic and Introspective Circumscription. [Citation Graph (0, 0)][DBLP]
    TARK, 1994, pp:197-207 [Conf]
  58. Varol Akman, Selim T. Erdogan, Joohyung Lee, Vladimir Lifschitz, Hudson Turner
    Representing the Zoo World and the Traffic World in the language of the Causal Calculator. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:153, n:1-2, pp:105-140 [Journal]
  59. Enrico Giunchiglia, G. Neelakantan Kartha, Vladimir Lifschitz
    Representing Action: Indeterminacy and Ramifications. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:95, n:2, pp:409-438 [Journal]
  60. Enrico Giunchiglia, Joohyung Lee, Vladimir Lifschitz, Norman McCain, Hudson Turner
    Nonmonotonic causal theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:153, n:1-2, pp:49-104 [Journal]
  61. Vladimir Lifschitz
    Review: M. Shanahan, Solving the Frame Problem. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:123, n:1-2, pp:265-268 [Journal]
  62. Vladimir Lifschitz
    Answer set programming and plan generation. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:138, n:1-2, pp:39-54 [Journal]
  63. Vladimir Lifschitz
    On the Satisfiability of Circumscription. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1986, v:28, n:1, pp:17-27 [Journal]
  64. Vladimir Lifschitz
    Frames in the Space of Situations. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1990, v:46, n:3, pp:365-376 [Journal]
  65. Vladimir Lifschitz
    Minimal Belief and Negation as Failure. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:70, n:1-2, pp:53-72 [Journal]
  66. Vladimir Lifschitz
    Nested Abnormality Theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1995, v:74, n:2, pp:351-365 [Journal]
  67. Vladimir Lifschitz, Arkady Rabinov
    Miracles in Formal Theories of Action. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1989, v:38, n:2, pp:225-237 [Journal]
  68. Vladimir Lifschitz
    On the Logic of Causal Explanation (Research Note). [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:96, n:2, pp:451-465 [Journal]
  69. Moisés Goldszmidt, Vladimir Lifschitz
    The Sixth International Workshop on Nonmonotonic Reasoning (Workshop Report).. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 1997, v:18, n:3, pp:89-90 [Journal]
  70. Chitta Baral, Vladik Kreinovich, Vladimir Lifschitz
    Introduction: Logic Programming, Non-Monotonic Reasoning and Reasoning about Actions. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1997, v:21, n:2-4, pp:129- [Journal]
  71. Vladimir Lifschitz
    ECWA Made Easy. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:14, n:2-4, pp:269-274 [Journal]
  72. Vladimir Lifschitz
    Two Components of an Action Language. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1997, v:21, n:2-4, pp:305-320 [Journal]
  73. Vladimir Lifschitz, Lappoon R. Tang, Hudson Turner
    Nested Expressions in Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1999, v:25, n:3-4, pp:369-389 [Journal]
  74. Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
    A generalization of the Lin-Zhao theorem. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2006, v:47, n:1-2, pp:79-101 [Journal]
  75. Vladimir Lifschitz
    On calculational proofs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:113, n:1-3, pp:207-224 [Journal]
  76. Yuliya Babovich, Esra Erdem, Vladimir Lifschitz
    Fages' Theorem and Answer Set Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  77. Esra Erdem, Vladimir Lifschitz
    Tight Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  78. Paolo Ferraris, Vladimir Lifschitz
    Weight Constraints as Nested Expressions [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  79. Vladimir Lifschitz
    The Logic of Common Sense. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1995, v:27, n:3, pp:343-345 [Journal]
  80. Michael Gelfond, Vladimir Lifschitz
    Action Languages. [Citation Graph (0, 0)][DBLP]
    Electron. Trans. Artif. Intell., 1998, v:2, n:, pp:193-210 [Journal]
  81. Vladimir Lifschitz
    On Verification of Programs With Goto Statements. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:4, pp:221-225 [Journal]
  82. Vladimir Lifschitz, Leon Pesotchinsky
    A Note on the Complexity of a Partition Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:3, pp:117-120 [Journal]
  83. Vladimir Lifschitz
    What Is the Inverse Method? [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1989, v:5, n:1, pp:1-23 [Journal]
  84. Vladimir Lifschitz
    Preface to the Special Issue on Commonsense and Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1995, v:14, n:1, pp:1- [Journal]
  85. Vladimir Lifschitz, Boris Pittel
    The Number of Increasing Subsequences of the Random Permutation. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:31, n:1, pp:1-20 [Journal]
  86. Vladimir Lifschitz
    Constructive Assertions in an Extension of Classical Mathematics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1982, v:47, n:2, pp:359-387 [Journal]
  87. Vladimir Lifschitz
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1992, v:2, n:6, pp:671-673 [Journal]
  88. Vladimir Lifschitz, Boris Pittel
    The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:329-346 [Journal]
  89. Vladimir Lifschitz, David Pearce, Agustín Valverde
    Strongly equivalent logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2001, v:2, n:4, pp:526-541 [Journal]
  90. Vladimir Lifschitz, Alexander A. Razborov
    Why are there so many loop formulas? [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:2, pp:261-268 [Journal]
  91. Esra Erdem, Vladimir Lifschitz
    Tight logic programs. [Citation Graph (0, 0)][DBLP]
    TPLP, 2003, v:3, n:4-5, pp:499-518 [Journal]
  92. Paolo Ferraris, Vladimir Lifschitz
    Weight constraints as nested expressions. [Citation Graph (0, 0)][DBLP]
    TPLP, 2005, v:5, n:1-2, pp:45-74 [Journal]
  93. Esra Erdem, Vladimir Lifschitz, Donald Ringe
    Temporal phylogenetic networks and logic programming. [Citation Graph (0, 0)][DBLP]
    TPLP, 2006, v:6, n:5, pp:539-558 [Journal]
  94. Vladimir Lifschitz, Wanwan Ren
    The Semantics of Variables in Action Descriptions. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1025-1030 [Conf]
  95. Vladimir Lifschitz
    Actions, Causation and Logic Programming. [Citation Graph (0, 0)][DBLP]
    ILP, 2006, pp:1- [Conf]

  96. A Reductive Semantics for Counting and Choice in Answer Set Programming. [Citation Graph (, )][DBLP]


  97. What Is Answer Set Programming?. [Citation Graph (, )][DBLP]


  98. Thirteen Definitions of a Stable Model. [Citation Graph (, )][DBLP]


  99. Twelve Definitions of a Stable Model. [Citation Graph (, )][DBLP]


  100. Safe Formulas in the General Theory of Stable Models (Preliminary Report). [Citation Graph (, )][DBLP]


  101. One More Decidable Class of Finitely Ground Programs. [Citation Graph (, )][DBLP]


  102. Symmetric Splitting in the General Theory of Stable Models. [Citation Graph (, )][DBLP]


  103. Translating First-Order Causal Theories into Answer Set Programming. [Citation Graph (, )][DBLP]


  104. Temporal Phylogenetic Networks and Logic Programming [Citation Graph (, )][DBLP]


Search in 2.283secs, Finished in 2.288secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002