Vladimir Lifschitz

From MaRDI portal
Person:234724

Available identifiers

zbMath Open lifschitz.vladimirWikidataQ7938456 ScholiaQ7938456MaRDI QIDQ234724

List of research outcomes

PublicationDate of PublicationType
Here and There with Arithmetic2023-12-12Paper
Towards Verifying Logic Programs in the Input Language of clingo2022-11-09Paper
Strong Equivalence of Logic Programs with Counting2022-09-30Paper
Loop checking and the well-founded semantics2022-08-30Paper
Transforming gringo rules into formulas in a natural way2021-12-01Paper
Verifying Tight Logic Programs with anthem and vampire2020-12-13Paper
Relating Two Dialects of Answer Set Programming2020-05-04Paper
https://portal.mardi4nfdi.de/entity/Q52402112019-10-24Paper
Verifying strong equivalence of programs in the input language of \textsc{gringo}2019-10-10Paper
Answer Set Programming2019-08-22Paper
Functional completion2018-08-28Paper
On equivalence of infinitary formulas under the stable model semantics2017-11-09Paper
Abstract gringo2017-11-09Paper
Stable models for infinitary formulas with extensional atoms2017-11-09Paper
Proving infinitary formulas2017-11-09Paper
Program completion in the input language of GRINGO2017-11-08Paper
Achievements in answer set programming2017-11-08Paper
Why are there so many loop formulas?2017-07-12Paper
https://portal.mardi4nfdi.de/entity/Q57404472016-07-26Paper
IN MEMORIAM: GRIGORI E. MINTS 1939–20142016-03-21Paper
The dramatic true story of the frame default2015-04-23Paper
Lloyd-Topor completion and general stable models2014-02-27Paper
https://portal.mardi4nfdi.de/entity/Q53980642014-02-25Paper
Nikolai Aleksandrovich Shanin (obituary)2013-12-17Paper
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics2013-10-10Paper
Relational theories with null values and non-herbrand stable models2013-03-13Paper
Representing first-order causal theories by logic programs2012-08-30Paper
https://portal.mardi4nfdi.de/entity/Q29091352012-08-29Paper
https://portal.mardi4nfdi.de/entity/Q30072612011-06-21Paper
Stable models and circumscription2011-06-17Paper
Termination of Grounding Is Not Preserved by Strongly Equivalent Transformations2011-05-26Paper
On the Minimality of Stable Models2011-05-19Paper
https://portal.mardi4nfdi.de/entity/Q29962652011-05-06Paper
Translating First-Order Causal Theories into Answer Set Programming2010-10-01Paper
Thirteen Definitions of a Stable Model2010-09-03Paper
Logic Programming2009-08-06Paper
One More Decidable Class of Finitely Ground Programs2009-07-24Paper
Twelve Definitions of a Stable Model2009-01-22Paper
Safe Formulas in the General Theory of Stable Models (Preliminary Report)2009-01-22Paper
https://portal.mardi4nfdi.de/entity/Q54262042007-11-16Paper
Logic Programming and Nonmonotonic Reasoning2007-11-07Paper
A generalization of the Lin-Zhao theorem2006-12-20Paper
Temporal phylogenetic networks and logic programming2006-08-28Paper
Nonmonotonic causal theories2006-02-07Paper
Representing the Zoo World and the Traffic World in the language of the Causal Calculator2006-02-07Paper
Weight constraints as nested expressions2005-04-29Paper
Tight logic programs2004-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47365162004-08-09Paper
Nikolai Aleksandrovich Shanin (on his 80th birthday)2003-08-28Paper
https://portal.mardi4nfdi.de/entity/Q44151032003-07-28Paper
Nested abnormality theories2003-02-04Paper
Answer set programming and plan generation2002-07-15Paper
On calculational proofs2002-03-13Paper
https://portal.mardi4nfdi.de/entity/Q47025762002-02-21Paper
https://portal.mardi4nfdi.de/entity/Q27671072002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q27349352001-08-30Paper
https://portal.mardi4nfdi.de/entity/Q45140102000-11-19Paper
Nested expressions in logic programs2000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49553312000-05-25Paper
https://portal.mardi4nfdi.de/entity/Q49553322000-05-25Paper
https://portal.mardi4nfdi.de/entity/Q49346512000-03-22Paper
On the logic of causal explanation1998-08-13Paper
Representing action: indeterminacy and ramifications1998-06-30Paper
Two components of an action language1998-06-09Paper
ECWA made easy1997-01-14Paper
Minimal belief and negation as failure1995-09-11Paper
Representing action and change by logic programs1994-03-20Paper
https://portal.mardi4nfdi.de/entity/Q40287951993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40288111993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40122301992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39830431992-06-26Paper
Frames in the space of situations1992-06-25Paper
Circumscriptive theories: A logic-based framework for knowledge representation1992-06-25Paper
What is the inverse method?1989-01-01Paper
Miracles in formal theories of action1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31988861989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34865501989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38305451989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38305561989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57503901988-01-01Paper
On the satisfiability of circumscription1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37490381986-01-01Paper
Closed-world databases and circumscription1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37441591985-01-01Paper
On verification of programs with goto statements1984-01-01Paper
A note on the complexity of a partition algorithm1983-01-01Paper
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms1983-01-01Paper
Constructive assertions in an extension of classical mathematics1982-01-01Paper
The number of increasing subsequences of the random permutation1981-01-01Paper
Semantical Completeness Theorems in Logic and Algebra1980-01-01Paper
The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis1980-01-01Paper
An Intuitionistic Definition of Classical Natural Numbers1979-01-01Paper
CT 0 is Stronger than CT 0 !1979-01-01Paper
Mathematical interpretation of the fan theorem1976-01-01Paper
Noncompact closed ball in a constructive compact metric space1976-01-01Paper
Investigation of constructive functions by the method of fillings1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41109851973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41138161973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56651791972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56266201971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56382881971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56281021969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55709111968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55854141968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56044631968-01-01Paper
Specialization of the form of deduction in the precicate calculus with equality and function symbols. I1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55815901967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55816201967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55816211967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55962361967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56468911967-01-01Paper
Consttuctive mathematical theories consistent with classical logic1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55366321967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55455031967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55498041967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55498051967-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Vladimir Lifschitz