Vladimir Lifschitz

According to our database1, Vladimir Lifschitz authored at least 146 papers between 1981 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Relating Two Dialects of Answer Set Programming.
TPLP, 2019

Verifying Strong Equivalence of Programs in the Input Language of gringo.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2019

Answer Set Programming
Springer, ISBN: 978-3-030-24657-0, 2019

2018
Interview with Vladimir Lifschitz.
KI, 2018

anthem: Transforming gringo Programs into First-Order Theories (Preliminary Report).
CoRR, 2018

2017
Achievements in answer set programming.
TPLP, 2017

Program completion in the input language of GRINGO.
TPLP, 2017

BWIBots: A platform for bridging the gap between AI and human-robot interaction research.
I. J. Robotics Res., 2017

In Memoriam: Grigori E. Mints, 1939-2014.
FLAP, 2017

Program Completionin the Input Language of GRINGO.
CoRR, 2017

Infinitary equilibrium logic and strongly equivalent logic programs.
Artif. Intell., 2017

2016
Proving infinitary formulas.
TPLP, 2016

Stable models for infinitary formulas with extensional atoms.
TPLP, 2016

Achievements in Answer Set Programming (Preliminary Report).
CoRR, 2016

Answer Sets and the Language of Answer Set Programming.
AI Magazine, 2016

Intelligent Instantiation and Supersafe Rules.
Proceedings of the Technical Communications of the 32nd International Conference on Logic Programming, 2016

2015
On equivalence of infinitary formulas under the stable model semantics.
TPLP, 2015

Abstract gringo.
TPLP, 2015

The Dramatic True Story of the Frame Default.
J. Philosophical Logic, 2015

In Memoriam: Grigori E. Mints 1939-2014.
Bulletin of Symbolic Logic, 2015

Infinitary Equilibrium Logic and Strong Equivalence.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2015

The Winograd Schema Challenge and Reasoning about Correlation.
Proceedings of the 2015 AAAI Spring Symposia, 2015

Pearl's Causality in a Logical Setting.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
The Semantics of Gringo and Infinitary Propositional Formulas.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Planning in Action Language BC while Learning Action Costs for Mobile Robots.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013
Lloyd-Topor completion and general stable models.
TPLP, 2013

Functional completion.
Journal of Applied Non-Classical Logics, 2013

On the Semantics of Gringo.
CoRR, 2013

On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

Logic Programs vs. First-Order Formulas in Textual Inference.
Proceedings of the 10th International Conference on Computational Semantics, 2013

Action Language BC: Preliminary Report.
Proceedings of the IJCAI 2013, 2013

2012
Relational theories with null values and non-herbrand stable models.
TPLP, 2012

Representing first-order causal theories by logic programs.
TPLP, 2012

Logic Programs with Intensional Functions.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Two-Valued Logic Programs.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

2011
Stable models and circumscription.
Artif. Intell., 2011

Termination of Grounding Is Not Preserved by Strongly Equivalent Transformations.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Yet Another Characterization of Strong Equivalence.
Proceedings of the Technical Communications of the 27th International Conference on Logic Programming, 2011

On the Minimality of Stable Models.
Proceedings of the Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011

2010
Translating First-Order Causal Theories into Answer Set Programming.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

Datalog Programs and Their Stable Models.
Proceedings of the Datalog Reloaded - First International Workshop, 2010

Thirteen Definitions of a Stable Model.
Proceedings of the Fields of Logic and Computation, 2010

2009
Symmetric Splitting in the General Theory of Stable Models.
Proceedings of the IJCAI 2009, 2009

One More Decidable Class of Finitely Ground Programs.
Proceedings of the Logic Programming, 25th International Conference, 2009

2008
Knowledge Representation and Classical Logic.
Proceedings of the Handbook of Knowledge Representation, 2008

Twelve Definitions of a Stable Model.
Proceedings of the Logic Programming, 24th International Conference, 2008

Safe Formulas in the General Theory of Stable Models (Preliminary Report).
Proceedings of the Logic Programming, 24th International Conference, 2008

What Is Answer Set Programming?.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

A Reductive Semantics for Counting and Choice in Answer Set Programming.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
A Characterization of Strong Equivalence for Logic Programs with Variables.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

A New Perspective on Stable Models.
Proceedings of the IJCAI 2007, 2007

Variables in Action Descriptions: Merging C+ with ADL.
Proceedings of the Logical Formalizations of Commonsense Reasoning, 2007

The Semantics of Variables in Action Descriptions.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Temporal phylogenetic networks and logic programming.
TPLP, 2006

Why are there so many loop formulas?
ACM Trans. Comput. Log., 2006

A generalization of the Lin-Zhao theorem.
Ann. Math. Artif. Intell., 2006

Actions as Special Cases.
Proceedings of the Proceedings, 2006

Actions, Causation and Logic Programming.
Proceedings of the Inductive Logic Programming, 16th International Conference, 2006

Towards a Modular Action Description Language.
Proceedings of the Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering, 2006

A Knowledge Module: Buying and Selling.
Proceedings of the Formalizing and Compiling Background Knowledge and Its Applications to Knowledge Representation and Question Answering, 2006

A Modular Action Description Language.
Proceedings of the Proceedings, 2006

2005
Weight constraints as nested expressions.
TPLP, 2005

Mathematical Foundations of Answer Set Programming.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

What is a Logic Program.
Proceedings of the Answer Set Programming, 2005

2004
Nonmonotonic causal theories.
Artif. Intell., 2004

Representing the Zoo World and the Traffic World in the language of the Causal Calculator.
Artif. Intell., 2004

Almost Definite Causal Theories.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

2003
Tight logic programs.
TPLP, 2003

Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming.
Proceedings of the Practical Aspects of Declarative Languages, 5th International Symposium, 2003

Describing Additive Fluents in Action Language C+.
Proceedings of the IJCAI-03, 2003

Loop Formulas for Disjunctive Logic Programs.
Proceedings of the Logic Programming, 19th International Conference, 2003

Definitions in Answer Set Programming: (Extended Abstract).
Proceedings of the Logic Programming, 19th International Conference, 2003

2002
Answer set programming and plan generation.
Artif. Intell., 2002

Why Sam doesn't know calculus.
Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), 2002

2001
Strongly equivalent logic programs.
ACM Trans. Comput. Log., 2001

On calculational proofs.
Ann. Pure Appl. Logic, 2001

Fages' Theorem for Programs with Nested Expressions.
Proceedings of the Logic Programming, 17th International Conference, 2001

Additive Fluents.
Proceedings of the Answer Set Programming, 2001

2000
Fages' Theorem and Answer Set Programming
CoRR, 2000

Review: M. Shanahan, Solving the Frame Problem.
Artif. Intell., 2000

Missionaries and Cannibals in the Causal Calculator.
Proceedings of the KR 2000, 2000

Wire Routing and Satisfiability Planning.
Proceedings of the Computational Logic, 2000

1999
Nested Expressions in Logic Programs.
Ann. Math. Artif. Intell., 1999

Representing Transition Systems by Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

Answer Set Planning (Abstract).
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

Transformations of Logic Programs Related to Causality and Planning.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

Answer Set Planning.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

Action Languages, Answer Sets, and Planning.
Proceedings of the Logic Programming Paradigm - A 25-Year Perspective, 1999

1998
Action Languages.
Electron. Trans. Artif. Intell., 1998

Situation Calculus and Causal Logic.
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

An Action Language Based on Causal Explanation: Preliminary Report.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
Two Components of an Action Language.
Ann. Math. Artif. Intell., 1997

Introduction: Logic Programming, Non-Monotonic Reasoning and Reasoning about Actions.
Ann. Math. Artif. Intell., 1997

The Sixth International Workshop on Nonmonotonic Reasoning (Workshop Report)..
AI Magazine, 1997

On the Logic of Causal Explanation (Research Note).
Artif. Intell., 1997

Representing Action: Indeterminacy and Ramifications.
Artif. Intell., 1997

1995
Preface to the Special Issue on Commonsense and Nonmonotonic Reasoning.
J. Autom. Reasoning, 1995

The Logic of Common Sense.
ACM Comput. Surv., 1995

ECWA Made Easy.
Ann. Math. Artif. Intell., 1995

Nested Abnormality Theories.
Artif. Intell., 1995

Loop Checking and the Wll-Founded Semantics.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

A Simple Formalization of Actions Using Circumscription.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Dependent Fluents.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

SLDNF, Constructive Negation and Grounding.
Proceedings of the Logic Programming, 1995

1994
Minimal Belief and Negation as Failure.
Artif. Intell., 1994

Autoepistemic Logic and Introspective Circumscription.
Proceedings of the 5th Conference on Theoretical Aspects of Reasoning about Knowledge, 1994

From Disjunctive Programs to Abduction.
Proceedings of the Non-Monotonic Extensions of Logic Programming (NMELP'94), 1994

Actions with Indirect Effects (Preliminary Report).
Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

Splitting a Logic Program.
Proceedings of the Logic Programming, 1994

1993
Representing Action and Change by Logic Programs.
J. Log. Program., 1993

Automated Reasoning About Actions: A Logic Programming Approach.
Proceedings of the Logic Programming, 1993

Extended Logic Programs as Autoepistemic Theories.
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1993

Restricted Monotonicity.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992
Editorial.
J. Log. Comput., 1992

Answer Sets in General Nonmonotonic Reasoning (Preliminary Report).
Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR'92). Cambridge, 1992

Representing Actions in Extended Logic Programming.
Proceedings of the Logic Programming, 1992

1991
Classical Negation in Logic Programs and Disjunctive Databases.
New Generation Comput., 1991

Toward a Metatheory of Action.
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

Disjective Defaults.
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

Nonmonotonic Databases and Epistemic Queries.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

What are the Limitations of the Situation Calculus?
Proceedings of the Automated Reasoning: Essays in Honor of Woody Bledsoe, 1991

1990
Frames in the Space of Situations.
Artif. Intell., 1990

Logic Programs with Classical Negation.
Proceedings of the Logic Programming, 1990

1989
What Is the Inverse Method?
J. Autom. Reasoning, 1989

Miracles in Formal Theories of Action.
Artif. Intell., 1989

The Mathematics of Nonmonotonic Reasoning (Abstract)
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Between Circumscription and Autoepistemic Logic.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

Critical Issues in Nonmonotonic Reasoning.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

Things That Change by Themselves.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

Logical Foundations of Deductive Databases.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988
Benchmark Problems for Formal Non-Monotonic Reasoning, Version 2.00.
Proceedings of the Non-Monotonic Reasoning, 1988

Compiling Circumscriptive Theories into Logic Programs.
Proceedings of the Non-Monotonic Reasoning, 1988

The Stable Model Semantics for Logic Programming.
Proceedings of the Logic Programming, 1988

On the Declarative Semantics of Logic Programs with Negation.
Proceedings of the Foundations of Deductive Databases and Logic Programming, 1988

1987
Formal Theories of Action (Preliminary Report).
Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987

Circumscriptive Theories: A Logic-based Framework for Knowledge Representation (Preliminary Report).
Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987

1986
On the Satisfiability of Circumscription.
Artif. Intell., 1986

Pointwise Circumscription: Preliminary Report.
Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

1985
Closed-World Databases and Circumscription.
Artif. Intell., 1985

Computing Circumscription.
Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1984
On Verification of Programs With Goto Statements.
Inf. Process. Lett., 1984

Some Results on Circumscription.
Proceedings of the Non-Monotonic Reasoning Workshop, 1984

1983
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms.
SIAM J. Comput., 1983

A Note on the Complexity of a Partition Algorithm.
Inf. Process. Lett., 1983

1982
Constructive Assertions in an Extension of Classical Mathematics.
J. Symb. Log., 1982

1981
The Number of Increasing Subsequences of the Random Permutation.
J. Comb. Theory, Ser. A, 1981


  Loading...