default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Lifschitz
Person information
- affiliation: University of Texas at Austin, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c89]Jorge Fandinno
, Vladimir Lifschitz:
Deductive Systems for Logic Programs with Counting: Preliminary Report. LPNMR 2024: 1-14- 2023
- [j61]Vladimir Lifschitz:
On Program Completion, with an Application to the Sum and Product Puzzle. Theory Pract. Log. Program. 23(4): 664-677 (2023) - [j60]Jorge Fandinno, Zachary Hansen, Yuliya Lierler, Vladimir Lifschitz, Nathan Temple:
External Behavior of a Logic Program and Verification of Refactoring. Theory Pract. Log. Program. 23(4): 933-947 (2023) - [j59]Jorge Fandinno, Vladimir Lifschitz:
Positive Dependency Graphs Revisited. Theory Pract. Log. Program. 23(5): 1128-1137 (2023) - [c88]Jorge Fandinno, Vladimir Lifschitz:
On Heuer's Procedure for Verifying Strong Equivalence. JELIA 2023: 253-261 - [c87]Jorge Fandinno, Vladimir Lifschitz:
Omega-Completeness of the Logic of Here-and-There and Strong Equivalence of Logic Programs. KR 2023: 240-251 - [i25]Vladimir Lifschitz:
On Program Completion, with an Application to the Sum and Product Puzzle. CoRR abs/2305.15360 (2023) - [i24]Jorge Fandinno, Zachary Hansen, Yuliya Lierler, Vladimir Lifschitz, Nathan Temple:
External Behavior of a Logic Program and Verification of Refactoring. CoRR abs/2305.17485 (2023) - [i23]Joohyung Lee, Vladimir Lifschitz, Ravi Palla:
Safe Formulas in the General Theory of Stable Models. CoRR abs/2307.09166 (2023) - [i22]Enrico Giunchiglia, Joohyung Lee, Vladimir Lifschitz, Hudson Turner:
Causal Laws and Multi-Valued Fluents. CoRR abs/2307.10227 (2023) - 2022
- [j58]Vladimir Lifschitz:
Strong Equivalence of Logic Programs with Counting. Theory Pract. Log. Program. 22(4): 573-588 (2022) - [c86]Vladimir Lifschitz:
Translating Definitions into the Language of Logic Programming: A Case Study. ICLP Workshops 2022 - [p3]Vladimir Lifschitz:
Calculational Proofs. Edsger Wybe Dijkstra 2022: 231-246 - [i21]Jorge Fandinno, Vladimir Lifschitz:
Verification of Locally Tight Programs. CoRR abs/2204.10789 (2022) - [i20]Vladimir Lifschitz:
Strong Equivalence of Logic Programs with Counting. CoRR abs/2205.07783 (2022) - [i19]Jorge Fandinno, Vladimir Lifschitz:
Positive Dependency Graphs Revisited. CoRR abs/2207.08579 (2022) - 2021
- [j57]Vladimir Lifschitz:
Here and There with Arithmetic. Theory Pract. Log. Program. 21(6): 735-749 (2021) - [c85]Vladimir Lifschitz:
Transforming Gringo Rules into Formulas in a Natural Way. JELIA 2021: 421-434 - [i18]Vladimir Lifschitz:
Here and There with Arithmetic. CoRR abs/2108.03187 (2021) - 2020
- [j56]Jorge Fandinno, Vladimir Lifschitz, Patrick Lühne, Torsten Schaub:
Verifying Tight Logic Programs with anthem and vampire. Theory Pract. Log. Program. 20(5): 735-750 (2020) - [c84]Vladimir Lifschitz, Patrick Lühne, Torsten Schaub:
Towards Verifying Logic Programs in the Input Language of clingo. Fields of Logic and Computation III 2020: 190-209 - [i17]Jorge Fandinno, Vladimir Lifschitz, Patrick Lühne, Torsten Schaub:
Verifying Tight Logic Programs with anthem and Vampire. CoRR abs/2008.02025 (2020)
2010 – 2019
- 2019
- [b1]Vladimir Lifschitz:
Answer Set Programming. Springer 2019, ISBN 978-3-030-24657-0, pp. 1-147 - [j55]Amelia Harrison, Vladimir Lifschitz:
Relating Two Dialects of Answer Set Programming. Theory Pract. Log. Program. 19(5-6): 1006-1020 (2019) - [c83]Vladimir Lifschitz, Patrick Lühne, Torsten Schaub:
Verifying Strong Equivalence of Programs in the Input Language of gringo. LPNMR 2019: 270-283 - [i16]Amelia Harrison, Vladimir Lifschitz:
Relating Two Dialects of Answer Set Programming. CoRR abs/1907.12139 (2019) - 2018
- [j54]Vladimir Lifschitz, Torsten Schaub, Stefan Woltran:
Interview with Vladimir Lifschitz. Künstliche Intell. 32(2-3): 213-218 (2018) - [i15]Vladimir Lifschitz, Patrick Lühne, Torsten Schaub:
anthem: Transforming gringo Programs into First-Order Theories (Preliminary Report). CoRR abs/1810.00453 (2018) - 2017
- [j53]Amelia Harrison, Vladimir Lifschitz, David Pearce, Agustín Valverde:
Infinitary equilibrium logic and strongly equivalent logic programs. Artif. Intell. 246: 22-33 (2017) - [j52]A. Burdman Feferman, Vladimir Lifschitz:
In Memoriam: Grigori E. Mints, 1939-2014. FLAP 4(4) (2017) - [j51]Piyush Khandelwal, Shiqi Zhang, Jivko Sinapov, Matteo Leonetti, Jesse Thomason, Fangkai Yang, Ilaria Gori, Maxwell Svetlik, Priyanka Khante, Vladimir Lifschitz, J. K. Aggarwal, Raymond J. Mooney, Peter Stone:
BWIBots: A platform for bridging the gap between AI and human-robot interaction research. Int. J. Robotics Res. 36(5-7): 635-659 (2017) - [j50]Amelia Harrison, Vladimir Lifschitz, Dhananjay Raju:
Program completion in the input language of GRINGO. Theory Pract. Log. Program. 17(5-6): 855-871 (2017) - [j49]Vladimir Lifschitz:
Achievements in answer set programming. Theory Pract. Log. Program. 17(5-6): 961-973 (2017) - [i14]Amelia Harrison, Vladimir Lifschitz, Dhananjay Raju:
Program Completionin the Input Language of GRINGO. CoRR abs/1707.05848 (2017) - 2016
- [j48]Vladimir Lifschitz:
Answer Sets and the Language of Answer Set Programming. AI Mag. 37(3): 7-12 (2016) - [j47]Amelia Harrison, Vladimir Lifschitz:
Stable models for infinitary formulas with extensional atoms. Theory Pract. Log. Program. 16(5-6): 771-786 (2016) - [j46]Amelia Harrison, Vladimir Lifschitz, Julian Michael:
Proving infinitary formulas. Theory Pract. Log. Program. 16(5-6): 787-799 (2016) - [c82]Vladimir Lifschitz:
Intelligent Instantiation and Supersafe Rules. ICLP (Technical Communications) 2016: 7:1-7:14 - [i13]Amelia Harrison, Vladimir Lifschitz:
Stable Models for Infinitary Formulas with Extensional Atoms. CoRR abs/1608.01603 (2016) - [i12]Amelia Harrison, Vladimir Lifschitz, Julian Michael:
Proving Infinitary Formulas. CoRR abs/1608.01626 (2016) - [i11]Vladimir Lifschitz:
Achievements in Answer Set Programming (Preliminary Report). CoRR abs/1608.08144 (2016) - 2015
- [j45]Solomon Feferman, Vladimir Lifschitz:
In Memoriam: Grigori E. Mints 1939-2014. Bull. Symb. Log. 21(1): 31-33 (2015) - [j44]Vladimir Lifschitz:
The Dramatic True Story of the Frame Default. J. Philos. Log. 44(2): 163-176 (2015) - [j43]Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski:
On equivalence of infinitary formulas under the stable model semantics. Theory Pract. Log. Program. 15(1): 18-34 (2015) - [j42]Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, Torsten Schaub:
Abstract gringo. Theory Pract. Log. Program. 15(4-5): 449-463 (2015) - [c81]Alexander Bochman, Vladimir Lifschitz:
Pearl's Causality in a Logical Setting. AAAI 2015: 1446-1452 - [c80]Daniel Bailey, Amelia J. Harrison, Yuliya Lierler, Vladimir Lifschitz, Julian Michael:
The Winograd Schema Challenge and Reasoning about Correlation. AAAI Spring Symposia 2015 - [c79]Amelia Harrison, Vladimir Lifschitz, David Pearce, Agustín Valverde:
Infinitary Equilibrium Logic and Strong Equivalence. LPNMR 2015: 398-410 - [i10]Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, Torsten Schaub:
Abstract Gringo. CoRR abs/1507.06576 (2015) - 2014
- [c78]Piyush Khandelwal, Fangkai Yang, Matteo Leonetti, Vladimir Lifschitz, Peter Stone:
Planning in Action Language BC while Learning Action Costs for Mobile Robots. ICAPS 2014 - [c77]Amelia J. Harrison, Vladimir Lifschitz, Fangkai Yang:
The Semantics of Gringo and Infinitary Propositional Formulas. KR 2014 - [i9]Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski:
On Equivalence of Infinitary Formulas under the Stable Model Semantics. CoRR abs/1403.6689 (2014) - 2013
- [j41]Vladimir Lifschitz, Fangkai Yang:
Functional completion. J. Appl. Non Class. Logics 23(1-2): 121-130 (2013) - [j40]Vladimir Lifschitz, Fangkai Yang:
Lloyd-Topor completion and general stable models. Theory Pract. Log. Program. 13(4-5): 503-515 (2013) - [c76]Joohyung Lee, Vladimir Lifschitz, Fangkai Yang:
Action Language BC: Preliminary Report. IJCAI 2013: 983-989 - [c75]Yuliya Lierler, Vladimir Lifschitz:
Logic Programs vs. First-Order Formulas in Textual Inference. IWCS 2013: 340-346 - [c74]Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski:
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics. LPNMR 2013: 387-394 - [i8]Vladimir Lifschitz, Fangkai Yang:
Lloyd-Topor Completion and General Stable Models. CoRR abs/1301.1394 (2013) - [i7]Amelia Harrison, Vladimir Lifschitz, Fangkai Yang:
On the Semantics of Gringo. CoRR abs/1312.6149 (2013) - 2012
- [j39]Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz, Fangkai Yang:
Representing first-order causal theories by logic programs. Theory Pract. Log. Program. 12(3): 383-412 (2012) - [j38]Vladimir Lifschitz, Karl Pichotta, Fangkai Yang:
Relational theories with null values and non-herbrand stable models. Theory Pract. Log. Program. 12(4-5): 565-582 (2012) - [c73]Vladimir Lifschitz:
Two-Valued Logic Programs. ICLP (Technical Communications) 2012: 259-266 - [c72]Vladimir Lifschitz:
Logic Programs with Intensional Functions. KR 2012 - [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]Vladimir Lifschitz:
Datalog Programs and Their Stable Models. Datalog 2010: 78-87 - [c66]Vladimir Lifschitz, Fangkai Yang:
Translating First-Order Causal Theories into Answer Set Programming. JELIA 2010: 247-259
2000 – 2009
- 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]Vladimir Lifschitz:
What Is Answer Set Programming?. AAAI 2008: 1594-1597 - [c61]Vladimir Lifschitz:
Twelve Definitions of a Stable Model. ICLP 2008: 37-51 - [c60]Joohyung Lee, Vladimir Lifschitz, Ravi Palla:
Safe Formulas in the General Theory of Stable Models (Preliminary Report). ICLP 2008: 672-676 - [e4]Frank van Harmelen, Vladimir Lifschitz, Bruce W. Porter:
Handbook of Knowledge Representation. Foundations of Artificial Intelligence 3, Elsevier 2008, ISBN 978-0-444-52211-5 [contents] - [r1]Vladimir Lifschitz, Leora Morgenstern, David A. Plaisted:
Knowledge Representation and Classical Logic. Handbook of Knowledge Representation 2008: 3-88 - 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. Theory Pract. Log. Program. 6(5): 539-558 (2006) - [c55]Vladimir Lifschitz, Wanwan Ren:
A Modular Action Description Language. AAAI 2006: 853-859 - [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]Vladimir Lifschitz:
Actions, Causation and Logic Programming. ILP 2006: 1 - [c51]Selim T. Erdogan, Vladimir Lifschitz:
Actions as Special Cases. KR 2006: 377-388 - 2005
- [j33]Paolo Ferraris, Vladimir Lifschitz:
Weight constraints as nested expressions. Theory Pract. Log. Program. 5(1-2): 45-74 (2005) - [c50]Vladimir Lifschitz:
What is a Logic Program. Answer Set Programming 2005 - [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 - [e3]Bart Demoen, Vladimir Lifschitz:
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 [contents] - [e2]Vladimir Lifschitz, Ilkka Niemelä:
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 [contents] - 2003
- [j30]Esra Erdem, Vladimir Lifschitz:
Tight logic programs. Theory Pract. Log. Program. 3(4-5): 499-518 (2003) - [c47]Joohyung Lee, Vladimir Lifschitz:
Loop Formulas for Disjunctive Logic Programs. ICLP 2003: 451-465 - [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]Esra Erdem, Vladimir Lifschitz:
Tight Logic Programs. CoRR cs.AI/0302038 (2003) - [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]Vladimir Lifschitz:
Why Sam doesn't know calculus. NMR 2002: 5 - 2001
- [j28]Vladimir Lifschitz:
On calculational proofs. Ann. Pure Appl. Log. 113(1-3): 207-224 (2001) - [j27]Vladimir Lifschitz, David Pearce, Agustín Valverde:
Strongly equivalent logic programs. ACM Trans. Comput. Log. 2(4): 526-541 (2001) - [c42]Joohyung Lee, Vladimir Lifschitz:
Additive Fluents. Answer Set Programming 2001 - [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]Vladimir Lifschitz:
Missionaries and Cannibals in the Causal Calculator. KR 2000: 85-96 - [i1]Yuliya Babovich, Esra Erdem, Vladimir Lifschitz:
Fages' Theorem and Answer Set Programming. CoRR cs.AI/0003042 (2000)
1990 – 1999
- 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]Vladimir Lifschitz:
Answer Set Planning. ICLP 1999: 23-37 - [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]Vladimir Lifschitz:
Answer Set Planning (Abstract). LPNMR 1999: 373-374 - [p2]Vladimir Lifschitz:
Action Languages, Answer Sets, and Planning. The Logic Programming Paradigm 1999: 357-373 - 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]Vladimir Lifschitz:
Situation Calculus and Causal Logic. KR 1998: 536-546 - 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 Mag. 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]Vladimir Lifschitz:
Nested Abnormality Theories. Artif. Intell. 74(2): 351-365 (1995) - [j17]Vladimir Lifschitz:
ECWA Made Easy. Ann. Math. Artif. Intell. 14(2-4): 269-274 (1995) - [j16]Vladimir Lifschitz:
The Logic of Common Sense. ACM Comput. Surv. 27(3): 343-345 (1995) - [j15]Vladimir Lifschitz:
Preface to the Special Issue on Commonsense and Nonmonotonic Reasoning. J. Autom. Reason. 14(1): 1 (1995) - [c32]Vladimir Lifschitz:
SLDNF, Constructive Negation and Grounding. ICLP 1995: 581-595 - [c31]Enrico Giunchiglia, Vladimir Lifschitz:
Dependent Fluents. IJCAI 1995: 1964-1969 - [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]Vladimir Lifschitz:
Minimal Belief and Negation as Failure. Artif. Intell. 70(1-2): 53-72 (1994) - [c28]Vladimir Lifschitz, Hudson Turner:
Splitting a Logic Program. ICLP 1994: 23-37 - [c27]G. Neelakantan Kartha, Vladimir Lifschitz:
Actions with Indirect Effects (Preliminary Report). KR 1994: 341-350 - [c26]Vladimir Lifschitz, Hudson Turner:
From Disjunctive Programs to Abduction. NMELP 1994: 23-42 - [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]Vladimir Lifschitz:
Restricted Monotonicity. AAAI 1993: 432-437 - [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]Vladimir Lifschitz:
Editorial. J. Log. Comput. 2(6): 671-673 (1992) - [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 Gener. 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]Vladimir Lifschitz:
Nonmonotonic Databases and Epistemic Queries. IJCAI 1991: 381-386 - [c17]Michael Gelfond, Halina Przymusinska, Vladimir Lifschitz, Miroslaw Truszczynski:
Disjective Defaults. KR 1991: 230-237 - [c16]Vladimir Lifschitz:
Toward a Metatheory of Action. KR 1991: 376-386 - [e1]Vladimir Lifschitz:
Artificial and Mathematical Theory of Computation, Papers in Honor of John McCarthy on the occasion of his sixty-fourth birthday. Academic Press / Elsevier 1991, ISBN 978-0-12-450010-5 [contents] - 1990
- [j10]Vladimir Lifschitz:
Frames in the Space of Situations. Artif. Intell. 46(3): 365-376 (1990) - [c15]Michael Gelfond, Vladimir Lifschitz:
Logic Programs with Classical Negation. ICLP 1990: 579-597
1980 – 1989
- 1989
- [j9]Vladimir Lifschitz, Arkady Rabinov:
Miracles in Formal Theories of Action. Artif. Intell. 38(2): 225-237 (1989) - [j8]Vladimir Lifschitz:
What Is the Inverse Method? J. Autom. Reason. 5(1): 1-23 (1989) - [c14]Vladimir Lifschitz:
Logical Foundations of Deductive Databases. IFIP Congress 1989: 315-321 - [c13]Vladimir Lifschitz, Arkady Rabinov:
Things That Change by Themselves. IJCAI 1989: 864-867 - [c12]Vladimir Lifschitz:
Between Circumscription and Autoepistemic Logic. KR 1989: 235-244 - [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]Vladimir Lifschitz:
The Mathematics of Nonmonotonic Reasoning (Abstract). LICS 1989: 242 - 1988
- [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 - [p1]Vladimir Lifschitz:
On the Declarative Semantics of Logic Programs with Negation. Foundations of Deductive Databases and Logic Programming. 1988: 177-192 - 1987
- [c5]Vladimir Lifschitz:
Circumscriptive Theories: A Logic-based Framework for Knowledge Representation (Preliminary Report). AAAI 1987: 364-368 - [c4]Vladimir Lifschitz:
Formal Theories of Action (Preliminary Report). IJCAI 1987: 966-972 - 1986
- [j7]Vladimir Lifschitz:
On the Satisfiability of Circumscription. Artif. Intell. 28(1): 17-27 (1986) - [c3]Vladimir Lifschitz:
Pointwise Circumscription: Preliminary Report. AAAI 1986: 406-410 - 1985
- [j6]Vladimir Lifschitz:
Closed-World Databases and Circumscription. Artif. Intell. 27(2): 229-235 (1985) - [c2]Vladimir Lifschitz:
Computing Circumscription. IJCAI 1985: 121-127 - 1984
- [j5]Vladimir Lifschitz:
On Verification of Programs With Goto Statements. Inf. Process. Lett. 18(4): 221-225 (1984) - [c1]Vladimir Lifschitz:
Some Results on Circumscription. NMR 1984: 151-164 - 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 G. 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 G. Pittel:
The Number of Increasing Subsequences of the Random Permutation. J. Comb. Theory A 31(1): 1-20 (1981)
Coauthor Index
Amelia Harrison
aka: Amelia J. Harrison
aka: Amelia J. Harrison
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
