Vladimir Lifschitz

Vladimir Lifschitz's AcademicInfluence.com Rankings

Vladimir Lifschitz

Computer Science

#828

World Rank

#859

Historical Rank

#450

USA Rank

Database

#1423

World Rank

#1496

Historical Rank

#380

USA Rank

computer-science Degrees

Download Badge

Computer Science

Vladimir Lifschitz's Degrees

PhD Mathematics Moscow State University

Why Is Vladimir Lifschitz Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Vladimir Lifschitz is the Gottesman Family Centennial Professor in Computer Sciences at the University of Texas at Austin. He received a degree in mathematics from the Steklov Institute of Mathematics in Russia in 1971 and emigrated to the United States in 1976. Lifschitz's research interests are in the areas of computational logic and knowledge representation. He is a Fellow of the Association for the Advancement of Artificial Intelligence, the Editor-in-Chief of the ACM Transactions on Computational Logic, and an Editorial Advisor of the journal Theory and Practice of Logic Programming.

(See a Problem?)

Vladimir Lifschitz's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Stable Model Semantics for Logic Programming (1988) (4182)
Classical negation in logic programs and disjunctive databases (1991) (1661)
Handbook of Knowledge Representation (2008) (815)
Representing Action and Change by Logic Programs (1993) (653)
Logic Programs with Classical Negation (1990) (640)
Strongly equivalent logic programs (2001) (552)
Nonmonotonic causal theories (2004) (516)
Computing Circumscription (1985) (500)
Answer set programming and plan generation (2002) (500)
Action Languages (1998) (406)
Splitting a Logic Program (1994) (399)
Nested expressions in logic programs (1999) (310)
ON THE SEMANTICS OF STRIPS (1987) (303)
An Action Language Based on Causal Explanation: Preliminary Report (1998) (267)
Answer Set Programming (2008) (215)
Stable models and circumscription (2011) (193)
Formalizing Common Sense: Papers by John McCarthy (1998) (187)
Formal theories of action (1987) (183)
Nonmonotonic Databases and Epistemic Queries (1991) (172)
Frames in the Space of Situations (1990) (160)
Action Languages, Answer Sets, and Planning (1999) (158)
Artificial intelligence and mathematical theory of computation: papers in honor of John McCarthy (1991) (156)
What are the Limitations of the Situation Calculus? (1991) (152)
On the Declarative Semantics of Logic Programs with Negation (1987) (151)
Pointwise circumscription (1987) (146)
Minimal Belief and Negation as Failure (1994) (145)
Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) (1992) (144)
Weight constraints as nested expressions (2003) (143)
A New Perspective on Stable Models (2007) (143)
Representing Actions in Extended Logic Programming (1992) (136)
Tight logic programs (2003) (128)
Representing Action: Indeterminacy and Ramifications (1997) (126)
Why are there so many loop formulas? (2006) (125)
Answer Set Planning (Abstract) (1999) (116)
Foundations of logic programming (1997) (112)
Actions with Indirect Effects (Preliminary Report) (1994) (112)
Closed-World Databases and Circumscription (1987) (103)
BWIBots: A platform for bridging the gap between AI and human–robot interaction research (2017) (101)
Loop Formulas for Disjunctive Logic Programs (2003) (98)
Representing Transition Systems by Logic Programs (1999) (85)
Theory of deductive systems and its applications (1987) (83)
On the Logic of Causal Explanation (Research Note) (1997) (80)
Formal Theories of Action (Preliminary Report) (1987) (78)
On Open Defaults (1990) (76)
On Open Defaults (1990) (76)
Pointwise Circumscription: Preliminary Report (1986) (75)
Compiling Circumscriptive Theories into Logic Programs (1989) (74)
On the Satisfiability of Circumscription (1986) (72)
A Characterization of Strong Equivalence for Logic Programs with Variables (2007) (72)
Abstract gringo (2015) (70)
Actions with Indirect Eeects (preliminary Report) (1994) (70)
One More Decidable Class of Finitely Ground Programs (2009) (66)
Extended Logic Programs as Autoepistemic Theories (1993) (66)
Representing the Zoo World and the Traffic World in the language of the Causal Calculator (2004) (65)
Twelve Definitions of a Stable Model (2008) (64)
Symmetric Splitting in the General Theory of Stable Models (2009) (61)
Nested Abnormality Theories (1995) (60)
Mathematical Foundations of Answer Set Programming (2005) (57)
A Modular Action Description Language (2006) (57)
Thirteen Definitions of a Stable Model (2010) (54)
Benchmark Problems for Formal Non-Monotonic Reasoning, Version 2.00 (1988) (53)
Miracles in Formal Theories of Action (1989) (52)
The Winograd Schema Challenge and Reasoning about Correlation (2015) (50)
Missionaries and Cannibals in the Causal Calculator (2000) (49)
Knowledge Representation and Classical Logic (2008) (48)
A Reductive Semantics for Counting and Choice in Answer Set Programming (2008) (47)
A generalization of the Lin-Zhao theorem (2006) (46)
Fages' Theorem and Answer Set Programming (2000) (46)
Some Results on Circumscription (1984) (45)
Between Circumscription and Autoepistemic Logic (1989) (44)
A Simple Formalization of Actions Using Circumscription (1995) (44)
Temporal phylogenetic networks and logic programming (2005) (40)
Describing Additive Fluents in Action Language C+ (2003) (39)
Wire Routing and Satisfiability Planning (2000) (36)
Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming (2003) (36)
Dependent Fluents (1995) (36)
Planning in Action Language BC while Learning Action Costs for Mobile Robots (2014) (35)
Toward a Metatheory of Action (1991) (35)
Restricted Monotonicity (1993) (34)
The Number of Increasing Subsequences of the Random Permutation (1981) (31)
Getting to the airport: the oldest planning problem in AI (2000) (30)
Definitions in Answer Set Programming: (Extended Abstract) (2003) (29)
Actions as Special Cases (2006) (27)
Theory and applications of answer set programming (2002) (23)
Safe Formulas in the General Theory of Stable Models (Preliminary Report) (2008) (22)
Logic Programs with Intensional Functions (2012) (21)
Computing answer sets using program completion (2003) (21)
Things That Change by Themselves (1989) (20)
Two components of an action language (1997) (20)
The Semantics of Gringo and Infinitary Propositional Formulas (2014) (19)
Cracking an Egg: An Exercise in Commonsense Reasoning (1998) (19)
Fages' Theorem for Programs with Nested Expressions (2001) (19)
Pearl's Causality in a Logical Setting (2015) (19)
A library of general-purpose action descriptions (2008) (18)
Handbook of Knowledge Representation 1 (2008) (18)
Representing first-order causal theories by logic programs (2011) (17)
is stronger than (1979) (17)
Causal Laws and Multi-Valued Fluents (2001) (17)
Transformations of Logic Programs Related to Causality and Planning (1999) (16)
Compiling circumscriptive theories into logic programs: preliminary report (1988) (16)
From Disjunctive Programs to Abduction (1994) (15)
Mechanical theorem proving in the USSR; the Leningrad school (1986) (14)
Calculational Proofs (2001) (14)
Infinitary equilibrium logic and strongly equivalent logic programs (2017) (14)
Answer Sets and the Language of Answer Set Programming (2016) (14)
Situation Calculus and Causal Logic (1998) (13)
Logic Programs vs. First-Order Formulas in Textual Inference (2013) (13)
Verifying Strong Equivalence of Programs in the Input Language of gringo (2019) (12)
Actions with Indirect Effects (Extended Abstract) (1995) (11)
On equivalence of infinitary formulas under the stable model semantics (2014) (11)
Reinforcing a Claim in Commonsense Reasoning (2003) (11)
Infinitary Equilibrium Logic and Strong Equivalence (2015) (11)
Achievements in answer set programming* (2016) (11)
CT 0 is Stronger than CT 0 (1979) (10)
Research Challenges and Opportunities in Knowledge Representation (2013) (10)
Program completion in the input language of GRINGO* (2017) (10)
Constructive assertions in an extension of classical mathematics (1982) (10)
The mathematics of nonmonotonic reasoning (1989) (10)
Almost Definite Causal Theories (2004) (10)
Guest editor's introduction: Reasoning about action and change (1997) (10)
Automated Reasoning About Actions: A Logic Programming Approach (1993) (9)
Lloyd-Topor completion and general stable models (2013) (9)
Representing Synonymity in Causal Logic and in Logic Programming (2010) (9)
The Semantics of Variables in Action Descriptions (2007) (9)
Calculable Natural Numbers (1985) (9)
Loop Checking and the Wll-Founded Semantics (1995) (9)
Additive Fluents (2001) (9)
Success of Default Logic (1999) (8)
Towards a Modular Action Description Language (2006) (8)
The Dramatic True Story of the Frame Default (2015) (8)
The efficiency of an algorithm of integer programming: a probabilistic analysis (1980) (7)
Semantical completeness theorems in logic and algebra (1980) (7)
Logic Programs with Intensional Functions ( Preliminary Report ) (2011) (7)
What is the inverse method? (1989) (7)
The logic of common sense (1995) (7)
anthem: Transforming gringo Programs into First-Order Theories (Preliminary Report) (2018) (7)
On the Minimality of Stable Models (2011) (7)
Eliminating Function Symbols from a Nonmonotonic Causal Theory (2011) (7)
Circumscriptive Theories: A Logic-based Framework for Knowledge Representation (Preliminary Report) (1987) (6)
Translating First-Order Causal Theories into Answer Set Programming (2010) (6)
Logical formalizations of commonsense reasoning : Papers from the AAAI Spring Symposium : Technical Report SS-07-05 (2007) (6)
Circumscription (2021) (6)
A Knowledge Module: Buying and Selling (2006) (6)
Verifying Tight Logic Programs with anthem and vampire (2020) (6)
Critical Issues in Nonmonotonic Reasoning (1989) (6)
Transitive Closure, Answer Sets and Predicate Completion (2001) (6)
Datalog Programs and Their Stable Models (2010) (6)
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms (1983) (6)
John McCarthy (1927–2011) (2011) (5)
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics (2013) (5)
Towards Verifying Logic Programs in the Input Language of clingo (2020) (5)
Relating Two Dialects of Answer Set Programming (2019) (5)
Logic Programming and Nonmonotonic Reasoning 7th International Conference, Lpnmr 2004, Fort Lauderdale, Fla., January 6-8, 2004 : Proceedings (2004) (5)
Functional completion (2013) (5)
SLDNF, Constructive Negation and Grounding (1995) (4)
Commentary on McDermott (1987) (4)
Two-Valued Logic Programs (2012) (4)
Intelligent Instantiation and Supersafe Rules (2016) (4)
Logical Foundations of Deductive Databases (1989) (4)
On the Semantics of Gringo (2013) (4)
Relational theories with null values and non-herbrand stable models (2012) (3)
Review: M. Shanahan, Solving the Frame Problem (2000) (3)
Logic Programming and Nonmonotonic Reasoning: 7th International Conference, Lpnmr 2004, Fort Lauderdale, Fl. Isa. Kamiaru 6-8. 2004: Proceedings (LECTURE NOTES IN COMPUTER SCIENCE) (2004) (3)
Stable models for infinitary formulas with extensional atoms (2016) (3)
Disjective Defaults (1991) (2)
A Representation of the Traffic World in the Language of the Causal Calculator (2001) (2)
Achievements in Answer Set Programming (Preliminary Report) (2016) (2)
On Verification of Programs With Goto Statements (1984) (2)
Transforming Gringo Rules into Formulas in a Natural Way (2021) (2)
Causal action theories and satisfiability planning (1998) (2)
Logic Programming and Nonmonotonic Reasoning (2004) (2)
Proving infinitary formulas (2016) (2)
Autoepistemic Logic and Introspective Circumscription (1994) (2)
Termination of Grounding Is Not Preserved by Strongly Equivalent Transformations (2011) (2)
The Workshop on Logic-Based Artificial Intelligence (1999) (2)
Why the Monkey Needs the Box: a Serious Look at a Toy Domain (2007) (2)
An intuitionistic definition of classical natural numbers (1979) (2)
Verification of Locally Tight Programs (2022) (1)
Linkk Oping Electronic Articles in Action Languages Linkk Oping Electronic Articles in Computer and Information Science (1998) (1)
Acapulco , Mexico , 2003 Describing Additive Fluents in Action Language � + (1)
Describing Additive Fluents in Action Language + (2003) (1)
Expressiveness of answer set languages (2007) (1)
The Frame Problem, Then and Now (2012) (1)
Logic Program (2005) (1)
Here and There with Arithmetic (2021) (1)
Introduction: Logic programming, non-monotonicreasoning and reasoning about actions (1997) (1)
ECWA made easy (1995) (1)
Yet Another Characterization of Strong Equivalence (2011) (1)
IN MEMORIAM: GRIGORI E. MINTS 1939–2014 (2015) (0)
Saturday Session 1 : Logic and Computer Science Equality in Type Theory-key concepts behind Homotopy Type Theory (2017) (0)
Combinatorial Search (2019) (0)
Nikolai Aleksandrovich Shanin (obituary) (2013) (0)
Propositional Programs and Minimal Models (2019) (0)
A Formal Method for Wire Routing (2004) (0)
Dependent Fluents Dependent Fluents (1995) (0)
Why Sam doesn't know calculus (2002) (0)
Variables in Action Descriptions: Merging C+ with ADL (2007) (0)
Theorem and Answer Set Programming (2013) (0)
The Stability Formula (2011) (0)
Safe Rules and Intelligent Instantiation (2015) (0)
From Felicitous Models to Answer Set Programming (2020) (0)
1 Calculational Proofs (2021) (0)
Programming 1 Here and There with Arithmetic (2021) (0)
${\rm CT}\sb{0}$ is stronger than ${\rm CT}\sb{0}!$ (1979) (0)
Preface to the special issue on commonsense and nonmonotonic reasoning (2004) (0)
Preface to the special issue on commonsense and nonmonotonic reasoning (1995) (0)
John McCarthy, 1927-2011: The Scientist Who Set Computers on the Path to Common Sense (2011) (0)
Program committee (2022) (0)
Correction to: Propositional Programs and Minimal Models (2019) (0)
Actions, Causation and Logic Programming (2007) (0)
From C-Believed Propositions to the Causal Calculator (2010) (0)
Logic Programming and Reasoning, 7th International Conference, LPNMR 2004, Fort Lauderdate, FL, USA, January 2004, Proceedings (2004) (0)
Revised version Action Languages (1998) (0)
Mathematics of Stable Models (2019) (0)
Review: Alan Bundy, The Computer Modelling of Mathematical Reasoning (1987) (0)
Strong Equivalence of Logic Programs with Counting (2022) (0)
The Logic of Common Sense Default Reasoning Commonsense Law of Inertia Logic and Computation (1995) (0)
Determining Ramifications in the Situation Calculus (1997) (0)
Conclusion (2019) (0)
More About the Language of clingo (2019) (0)
The Dramatic True Story of the Frame Default (2014) (0)
Dynamic Systems (2017) (0)
Logic Programming 20th International Conference, Iclp 2004, Saint-Malo, France, September 6-10, 2004 : Proceedings (2004) (0)
2 The MAD language and the briefcase domain (2008) (0)
Positive Dependency Graphs Revisited (2022) (0)
The Sixth International Workshop on Nonmonotonic Reasoning (Workshop Report) (1997) (0)
The Mathematics of Nonmonotonic Reasoning (Abstract) (1989) (0)
Programs with Negation (2019) (0)
A Note on the Complexity of a Partition Algorithm (1983) (0)
Proceedings 37th International Conference on Logic Programming (Technical Communications) (2021) (0)
Proceedings 38th International Conference on Logic Programming (2022) (0)
Input Language of clingo (2019) (0)
Interview with Vladimir Lifschitz (2018) (0)
Interview with Vladimir Lifschitz (2018) (0)
Translating Definitions into the Language of Logic Programming: A Case Study (2022) (0)

This paper list is powered by the following services:

Other Resources About Vladimir Lifschitz

What Schools Are Affiliated With Vladimir Lifschitz?

Vladimir Lifschitz is affiliated with the following schools:

Vladimir Lifschitz's Academic­Influence.com Rankings