| 2013 | ||
|---|---|---|
| i7 | Vladimir Lifschitz, Fangkai Yang: Lloyd-Topor Completion and General Stable Models. CoRR abs/1301.1394 (2013) | |
| 2012 | ||
| j39 | Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz, Fangkai Yang: Representing first-order causal theories by logic programs. TPLP 12(3): 383-412 (2012) | |
| j38 | Vladimir Lifschitz, Karl Pichotta, Fangkai Yang: Relational theories with null values and non-herbrand stable models. TPLP 12(4-5): 565-582 (2012) | |
| c73 | ||
| c72 | ||
| i6 | Vladimir Lifschitz, Karl Pichotta, Fangkai Yang: Relational Theories with Null Values and Non-Herbrand Stable Models. CoRR abs/1210.4130 (2012) | |
| 2011 | ||
| j37 | Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz: Stable models and circumscription. Artif. Intell. 175(1): 236-263 (2011) | |
| c71 | Paolo Ferraris, Vladimir Lifschitz: On the Minimality of Stable Models. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 64-73 | |
| c70 | Alexander Bochman, Vladimir Lifschitz: Yet Another Characterization of Strong Equivalence. ICLP (Technical Communications) 2011: 11-15 | |
| c69 | Yuliya Lierler, Vladimir Lifschitz: Termination of Grounding Is Not Preserved by Strongly Equivalent Transformations. LPNMR 2011: 205-210 | |
| i5 | Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz, Fangkai Yang: Representing First-Order Causal Theories by Logic Programs. CoRR abs/1103.4558 (2011) | |
| 2010 | ||
| c68 | Vladimir Lifschitz: Thirteen Definitions of a Stable Model. Fields of Logic and Computation 2010: 488-503 | |
| c67 | ||
| c66 | Vladimir Lifschitz, Fangkai Yang: Translating First-Order Causal Theories into Answer Set Programming. JELIA 2010: 247-259 | |
| 2009 | ||
| c65 | Yuliya Lierler, Vladimir Lifschitz: One More Decidable Class of Finitely Ground Programs. ICLP 2009: 489-493 | |
| c64 | Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, Ravi Palla: Symmetric Splitting in the General Theory of Stable Models. IJCAI 2009: 797-803 | |
| 2008 | ||
| c63 | Joohyung Lee, Vladimir Lifschitz, Ravi Palla: A Reductive Semantics for Counting and Choice in Answer Set Programming. AAAI 2008: 472-479 | |
| c62 | ||
| c61 | ||
| c60 | Joohyung Lee, Vladimir Lifschitz, Ravi Palla: Safe Formulas in the General Theory of Stable Models (Preliminary Report). ICLP 2008: 672-676 | |
| 2007 | ||
| c59 | Vladimir Lifschitz, Wanwan Ren: The Semantics of Variables in Action Descriptions. AAAI 2007: 1025-1030 | |
| c58 | Vladimir Lifschitz, Wanwan Ren: Variables in Action Descriptions: Merging C+ with ADL. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2007: 83-88 | |
| c57 | Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz: A New Perspective on Stable Models. IJCAI 2007: 372-379 | |
| c56 | Vladimir Lifschitz, David Pearce, Agustín Valverde: A Characterization of Strong Equivalence for Logic Programs with Variables. LPNMR 2007: 188-200 | |
| 2006 | ||
| j36 | Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz: A generalization of the Lin-Zhao theorem. Ann. Math. Artif. Intell. 47(1-2): 79-101 (2006) | |
| j35 | Vladimir Lifschitz, Alexander A. Razborov: Why are there so many loop formulas? ACM Trans. Comput. Log. 7(2): 261-268 (2006) | |
| j34 | Esra Erdem, Vladimir Lifschitz, Donald Ringe: Temporal phylogenetic networks and logic programming. TPLP 6(5): 539-558 (2006) | |
| c55 | ||
| c54 | Joohyung Lee, Vladimir Lifschitz: A Knowledge Module: Buying and Selling. AAAI Spring Symposium: Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering 2006: 28-32 | |
| c53 | Vladimir Lifschitz, Wanwan Ren: Towards a Modular Action Description Language. AAAI Spring Symposium: Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering 2006: 33-43 | |
| c52 | ||
| c51 | ||
| 2005 | ||
| j33 | Paolo Ferraris, Vladimir Lifschitz: Weight constraints as nested expressions. TPLP 5(1-2): 45-74 (2005) | |
| c50 | ||
| c49 | Paolo Ferraris, Vladimir Lifschitz: Mathematical Foundations of Answer Set Programming. We Will Show Them! (1) 2005: 615-664 | |
| i4 | Esra Erdem, Vladimir Lifschitz, Donald Ringe: Temporal Phylogenetic Networks and Logic Programming. CoRR abs/cs/0508129 (2005) | |
| 2004 | ||
| j32 | Enrico Giunchiglia, Joohyung Lee, Vladimir Lifschitz, Norman McCain, Hudson Turner: Nonmonotonic causal theories. Artif. Intell. 153(1-2): 49-104 (2004) | |
| j31 | 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. Artif. Intell. 153(1-2): 105-140 (2004) | |
| c48 | Semra Dogandag, Paolo Ferraris, Vladimir Lifschitz: Almost Definite Causal Theories. LPNMR 2004: 74-86 | |
| e2 | Bart Demoen, Vladimir Lifschitz (Eds.): Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings. Lecture Notes in Computer Science 3132, Springer 2004, isbn 3-540-22671-0 | |
| e1 | Vladimir Lifschitz, Ilkka Niemelä (Eds.): Logic Programming and Nonmonotonic Reasoning, 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings. Lecture Notes in Computer Science 2923, Springer 2004, isbn 3-540-20721-X | |
| 2003 | ||
| j30 | ||
| c47 | ||
| c46 | Selim T. Erdogan, Vladimir Lifschitz: Definitions in Answer Set Programming: (Extended Abstract). ICLP 2003: 483-484 | |
| c45 | Joohyung Lee, Vladimir Lifschitz: Describing Additive Fluents in Action Language C+. IJCAI 2003: 1079-1084 | |
| c44 | Esra Erdem, Vladimir Lifschitz, Luay Nakhleh, Donald Ringe: Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming. PADL 2003: 160-176 | |
| i3 | ||
| i2 | Paolo Ferraris, Vladimir Lifschitz: Weight Constraints as Nested Expressions. CoRR cs.AI/0312045 (2003) | |
| 2002 | ||
| j29 | Vladimir Lifschitz: Answer set programming and plan generation. Artif. Intell. 138(1-2): 39-54 (2002) | |
| c43 | ||
| 2001 | ||
| j28 | ||
| j27 | Vladimir Lifschitz, David Pearce, Agustín Valverde: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2(4): 526-541 (2001) | |
| c42 | ||
| c41 | Esra Erdem, Vladimir Lifschitz: Fages' Theorem for Programs with Nested Expressions. ICLP 2001: 242-254 | |
| 2000 | ||
| j26 | Vladimir Lifschitz: Review: M. Shanahan, Solving the Frame Problem. Artif. Intell. 123(1-2): 265-268 (2000) | |
| c40 | Esra Erdem, Vladimir Lifschitz, Martin D. F. Wong: Wire Routing and Satisfiability Planning. Computational Logic 2000: 822-836 | |
| c39 | ||
| i1 | Yuliya Babovich, Esra Erdem, Vladimir Lifschitz: Fages' Theorem and Answer Set Programming. CoRR cs.AI/0003042 (2000) | |
| 1999 | ||
| j25 | Vladimir Lifschitz, Lappoon R. Tang, Hudson Turner: Nested Expressions in Logic Programs. Ann. Math. Artif. Intell. 25(3-4): 369-389 (1999) | |
| c38 | ||
| c37 | Vladimir Lifschitz, Hudson Turner: Representing Transition Systems by Logic Programs. LPNMR 1999: 92-106 | |
| c36 | Esra Erdem, Vladimir Lifschitz: Transformations of Logic Programs Related to Causality and Planning. LPNMR 1999: 107-116 | |
| c35 | ||
| 1998 | ||
| j24 | Michael Gelfond, Vladimir Lifschitz: Action Languages. Electron. Trans. Artif. Intell. 2: 193-210 (1998) | |
| c34 | Enrico Giunchiglia, Vladimir Lifschitz: An Action Language Based on Causal Explanation: Preliminary Report. AAAI/IAAI 1998: 623-630 | |
| c33 | ||
| 1997 | ||
| j23 | Enrico Giunchiglia, G. Neelakantan Kartha, Vladimir Lifschitz: Representing Action: Indeterminacy and Ramifications. Artif. Intell. 95(2): 409-438 (1997) | |
| j22 | Vladimir Lifschitz: On the Logic of Causal Explanation (Research Note). Artif. Intell. 96(2): 451-465 (1997) | |
| j21 | Moisés Goldszmidt, Vladimir Lifschitz: The Sixth International Workshop on Nonmonotonic Reasoning (Workshop Report).. AI Magazine 18(3): 89 (1997) | |
| j20 | Chitta Baral, Vladik Kreinovich, Vladimir Lifschitz: Introduction: Logic Programming, Non-Monotonic Reasoning and Reasoning about Actions. Ann. Math. Artif. Intell. 21(2-4): 129 (1997) | |
| j19 | Vladimir Lifschitz: Two Components of an Action Language. Ann. Math. Artif. Intell. 21(2-4): 305-320 (1997) | |
| 1995 | ||
| j18 | ||
| j17 | ||
| j16 | ||
| j15 | Vladimir Lifschitz: Preface to the Special Issue on Commonsense and Nonmonotonic Reasoning. J. Autom. Reasoning 14(1): 1 (1995) | |
| c32 | ||
| c31 | ||
| c30 | G. Neelakantan Kartha, Vladimir Lifschitz: A Simple Formalization of Actions Using Circumscription. IJCAI 1995: 1970-1977 | |
| c29 | Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk: Loop Checking and the Wll-Founded Semantics. LPNMR 1995: 127-142 | |
| 1994 | ||
| j14 | ||
| c28 | ||
| c27 | G. Neelakantan Kartha, Vladimir Lifschitz: Actions with Indirect Effects (Preliminary Report). KR 1994: 341-350 | |
| c26 | ||
| c25 | Michael Gelfond, Vladimir Lifschitz, Halina Przymusinska, Grigori Schwarz: Autoepistemic Logic and Introspective Circumscription. TARK 1994: 197-207 | |
| 1993 | ||
| j13 | Michael Gelfond, Vladimir Lifschitz: Representing Action and Change by Logic Programs. J. Log. Program. 17(2/3&4): 301-321 (1993) | |
| c24 | ||
| c23 | Vladimir Lifschitz, Grigori Schwarz: Extended Logic Programs as Autoepistemic Theories. LPNMR 1993: 101-114 | |
| c22 | Vladimir Lifschitz, Norman McCain, Hudson Turner: Automated Reasoning About Actions: A Logic Programming Approach. ILPS 1993: 641 | |
| 1992 | ||
| j12 | ||
| c21 | Michael Gelfond, Vladimir Lifschitz: Representing Actions in Extended Logic Programming. JICSLP 1992: 559-573 | |
| c20 | Vladimir Lifschitz, Thomas Y. C. Woo: Answer Sets in General Nonmonotonic Reasoning (Preliminary Report). KR 1992: 603-614 | |
| 1991 | ||
| j11 | Michael Gelfond, Vladimir Lifschitz: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Comput. 9(3/4): 365-386 (1991) | |
| c19 | Michael Gelfond, Vladimir Lifschitz, Arkady Rabinov: What are the Limitations of the Situation Calculus? Automated Reasoning: Essays in Honor of Woody Bledsoe 1991: 167-180 | |
| c18 | ||
| c17 | Michael Gelfond, Halina Przymusinska, Vladimir Lifschitz, Miroslaw Truszczynski: Disjective Defaults. KR 1991: 230-237 | |
| c16 | ||
| 1990 | ||
| j10 | ||
| c15 | ||
| 1989 | ||
| j9 | Vladimir Lifschitz, Arkady Rabinov: Miracles in Formal Theories of Action. Artif. Intell. 38(2): 225-237 (1989) | |
| j8 | ||
| c14 | ||
| c13 | ||
| c12 | ||
| c11 | David W. Etherington, Kenneth D. Forbus, Matthew L. Ginsberg, David J. Israel, Vladimir Lifschitz: Critical Issues in Nonmonotonic Reasoning. KR 1989: 500-504 | |
| c10 | ||
| 1988 | ||
| p1 | Vladimir Lifschitz: On the Declarative Semantics of Logic Programs with Negation. Foundations of Deductive Databases and Logic Programming. 1988: 177-192 | |
| c9 | Michael Gelfond, Vladimir Lifschitz: Compiling Circumscriptive Theories into Logic Programs. AAAI 1988: 455-449 | |
| c8 | Michael Gelfond, Vladimir Lifschitz: The Stable Model Semantics for Logic Programming. ICLP/SLP 1988: 1070-1080 | |
| c7 | Michael Gelfond, Vladimir Lifschitz: Compiling Circumscriptive Theories into Logic Programs. NMR 1988: 74-99 | |
| c6 | Vladimir Lifschitz: Benchmark Problems for Formal Non-Monotonic Reasoning, Version 2.00. NMR 1988: 202-219 | |
| 1987 | ||
| c5 | Vladimir Lifschitz: Circumscriptive Theories: A Logic-based Framework for Knowledge Representation (Preliminary Report). AAAI 1987: 364-368 | |
| c4 | ||
| 1986 | ||
| j7 | ||
| c3 | ||
| 1985 | ||
| j6 | Vladimir Lifschitz: Closed-World Databases and Circumscription. Artif. Intell. 27(2): 229-235 (1985) | |
| c2 | ||
| 1984 | ||
| j5 | Vladimir Lifschitz: On Verification of Programs With Goto Statements. Inf. Process. Lett. 18(4): 221-225 (1984) | |
| c1 | ||
| 1983 | ||
| j4 | Vladimir Lifschitz, Leon Pesotchinsky: A Note on the Complexity of a Partition Algorithm. Inf. Process. Lett. 17(3): 117-120 (1983) | |
| j3 | Vladimir Lifschitz, Boris Pittel: The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms. SIAM J. Comput. 12(2): 329-346 (1983) | |
| 1982 | ||
| j2 | Vladimir Lifschitz: Constructive Assertions in an Extension of Classical Mathematics. J. Symb. Log. 47(2): 359-387 (1982) | |
| 1981 | ||
| j1 | Vladimir Lifschitz, Boris Pittel: The Number of Increasing Subsequences of the Random Permutation. J. Comb. Theory, Ser. A 31(1): 1-20 (1981) | |
Colors in the list of coauthors
Last update Sat May 18 15:03:57 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page