Skip to search formSkip to main contentSkip to account menu

Vladimir Lifschitz

Vladimir Lifschitz is the Gottesman Family Centennial Professor in Computer Sciences at the University of Texas at Austin. He received a degree in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
ACM Transactions on Computational LogicCircumscription (logic)Michael GelfondNegation as failure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Circumscriptive Event Calculus as Answer Set Programming
Recently, Ferraris, Lee and Lifschitz presented a general definition of a stable model that is similar to the definition of… 
2008
2008
Knowledge Coordinating Knowledge Sharing through Peer – to – Peer Interaction
The drive to extend the Web by taking advantage of automated symbolic reasoning (the so-called Semantic Web) has been dominated… 
1997
1997
Defeasible Specifications in Action Theories
Recent research in formalizing effects of actions on a world in the presence of constraints have mostly concentrated on non… 
1997
1997
Combining Explicit Negation and Negation by Failure Via Belnap's Logic
1996
1996
Two remarks on the Lifschitz realizability topos
The purpose of this note is to clarify two points about the topos Lif, introduced in [13] as a generalization of Lifschitz… 
Review
1996
Review
1996
Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview
44 played a dominant role in Przymusinski's versions of WFS and ST N. The results of Section 4 underline the very strong… 
1994
1994
The Stable Semantics and its Variants: A Comparison of Recent Approaches
The stable and the well-founded semantics are among the leading semantics for logic programs. While stable models do not always… 
1993
1993
The model logic Z applied to Lifschitz's benchmark problems for formal nonmonotonic reasoning
To give a standard against which to judge the limitations and possibilities of a theory of nonmonotonic reasoning, V. Lifschitz… 
1993
1993
An Abductive Framework for General Logic Programs and other Nonmonotonic Systems
We present an abductive semantics for general propositional logic programs which defines the meaning of a logic program in terms… 
Highly Cited
1987
Highly Cited
1987
Theory of deductive systems and its applications
In a fluent, clear, and lively style this translation by two of Maslov's junior colleagues brings the work of the late Soviet… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)