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