@misc{LifschitzSchaubWoltran2018,
  author    = {Lifschitz, Vladimir and Schaub, Torsten H. and Woltran, Stefan},
  title     = {Interview with Vladimir Lifschitz},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0552-x},
  pages     = {213 -- 218},
  year      = {2018},
  abstract  = {This interview with Vladimir Lifschitz was conducted by Torsten Schaub at the University of Texas at Austin in August 2017. The question set was compiled by Torsten Schaub and Stefan Woltran.},
  language  = {en}
}
@article{FandinnoLifschitzLuehneetal.2020,
  author    = {Fandinno, Jorge and Lifschitz, Vladimir and L{\"u}hne, Patrick and Schaub, Torsten H.},
  title     = {Verifying tight logic programs with Anthem and Vampire},
  series = {Theory and practice of logic programming},
  volume    = {20},
  journal   = {Theory and practice of logic programming},
  number    = {5},
  publisher = {Cambridge Univ. Press},
  address   = {Cambridge [u.a.]},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068420000344},
  pages     = {735 -- 750},
  year      = {2020},
  abstract  = {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.},
  language  = {en}
}