Vladimir Lifschitz

Vladimir Lifschitz

Auto-generated profile, based on publicly available information

Vladimir Lifschitz

University of Texas at Austin

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 July 2003 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
EEEsra Erdem
Esra Erdem
VLVladimir Lifschitz
Vladimir Lifschitz
This note is about the relationship between two theories of negation as failure – one based on program completion, the other based on stable models, or answer sets. François Fages showed that if a logic program satisfies a certain syntactic condition, which is now called ‘tightness,’ then its stable models can be characterized as the models of its completion. We extend the definition of tightness and Fages' theorem to programs with nested expressions in the bodies of rules, and study tight logic programs containing the definition of the transitive closure of a predicate.

10 January 2005 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
PFPaolo Ferraris
Paolo Ferraris
VLVladimir Lifschitz
Vladimir Lifschitz
We compare two recent extensions of the answer set (stable model) semantics of logic programs. One of them, due to Lifschitz, Tang and Turner, allows the bodies and heads of rules to contain nested expressions. The other, due to Niemelä and Simons, uses weight constraints. We show that there is a simple, modular translation from the language of weight constraints into the language of nested expressions that preserves the program's answer sets. Nested expressions can be eliminated from the result of this translation in favor of additional atoms. The translation makes it possible to compute answer sets for some programs with weight constraints using satisfiability solvers, and to prove the strong equivalence of programs with weight constraints using the logic of here-and-there.

1 July 2015 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
Martin GebserMartin Gebser
Martin Gebser
AHAmelia Harrison
Amelia Harrison
RKRoland Kaminski
Roland Kaminski
VLVladimir Lifschitz
Vladimir Lifschitz
TSTorsten Schaub
Torsten Schaub
This paper defines the syntax and semantics of the input language of the ASP groundergringo. The definition covers several constructs that were not discussed in earlier work on the semantics of that language, including intervals, pools, division of integers, aggregates with non-numeric values, and lparse-style aggregate expressions. The definition is abstract in the sense that it disregards some details related to representing programs by strings of ASCII characters. It serves as a specification forgringofrom Version 4.5 on.

1 October 1994 in Artificial Intelligence
Verified
Journal Article
Closed access
VLVladimir Lifschitz
Vladimir Lifschitz

1 September 1997 in Artificial Intelligence
Verified
Journal Article
Closed access
EGEnrico Giunchiglia
Enrico Giunchiglia
GKG.NEelakantan Kartha
G.NEelakantan Kartha
VLVladimir Lifschitz
Vladimir Lifschitz

1 July 2020 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
JFJorge Fandinno
Jorge Fandinno
VLVladimir Lifschitz
Vladimir Lifschitz
PLPatrick Lühne
Patrick Lühne
TSTorsten Schaub
Torsten Schaub
This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.