Texas Action Group
Texas Action Group at Austin is a research group within the Department of Computer Science of the University of Texas at Austin. The group is led by Vladimir Lifschitz. It is part of a larger community, Texas Action Group. We work in the area of logic-based Artificial Intelligence. Specifically, we are interested in action description languages, in automated reasoning about the effects of actions, in the theory of stable models, and in answer set programming.
Amelia Harrison Ph.D. Student ameliaj [at] cs utexas edu
Vladimir Lifschitz Faculty vl [at] cs utexas edu
Julian John Michael Undergraduate Student julianjm [at] cs utexas edu
Fangkai Yang Ph.D. Student fkyang [at] cs utexas edu
     [Expand to show all 173][Minimize]
Infinitary Equilibrium Logic 2014
Amelia Harrison, Vladimir Lifschitz, Agustin Valverde, David Pearce, unpublished.
On Equivalence of Infinitary Formulas under the Stable Model Semantics 2014
Amelia Harrison, Vladimir Lifschitz and Miroslaw Truszczynski, To Appear In Theory and Practice of Logic Programming (2014).
Representing Actions in Logic-Based Languages 2014
Fangkai Yang, PhD Thesis, Department of Computer Sciences, The University of Texas at Austin.
The Semantics of Gringo and Infinitary Propositional Formulas 2014
Amelia Harrison, Vladimir Lifschitz and Fangkai Yang, To Appear In 14th International Conference on Principles of Knowledge Representation and Reasoning 2014.
Abstract Modular Systems and Solvers 2013
Yuliya Lierler, Miroslaw Truszczynski, In Proceedings of Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'13) 2013.
Action Language BC: Preliminary Report 2013
Joohyung Lee, Vladimir Lifschitz, and Fangkai Yang, In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI) 2013.
Functional Completion 2013
Vladimir Lifschitz and Fangkai Yang, Journal of Applied Non-Classical Logics, Vol. 23, 1-2 (2013).
Hybrid Automated Reasoning Tools: from Black-box to Clear-box Integration 2013
Marcello Balduccini, Yuliya Lierler , In Proceedings of Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP'13) 2013.
Integration Schemas for Constraint Answer Set Programming: a Case Study (technical communications) 2013
Marcello Balduccini, Yuliya Lierler, Theory and Practice of Logic Programming, On-line Supplement (2013).
Lloyd-Topor Completion and General Stable Models 2013
Vladimir Lifschitz and Fangkai Yang, Theory and Practice of Logic Programming, Vol. 13, 4-5 (2013), pp. 503-515.
Logic Programs vs. First-Order Formulas in Textual Inference 2013
Yuliya Lierler and Vladimir Lifschitz, 10th International Conference on Computational Semantics (IWCS) (2013).
Modular Answer Set Solving 2013
Yuliya Lierler, Miroslaw Truszczynski, In Proceedings of Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-13) 2013.
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics (Preliminary Report) 2013
Amelia Harrison, Vladimir Lifschitz and Miroslaw Truszczynski, In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Corunna, Spain, September 2013.
On the Semantics of Gringo 2013
Amelia Harrison, Vladimir Lifschitz, and Fangkai Yang, In Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), Istanbul, Turkey, August 2013.
Prolog and ASP Inference Under One Roof 2013
Marcello Balduccini, Yuliya Lierler, Peter Schueller, In Proceedings of 12th International Conference on Logic Programming and Nonmonotonic Reasoning 2013.
Representing Actions in Logic-based Languages 2013
Fangkai Yang, To Appear In TPLP, Online Supplement (2013).
Role of KR in Natural Language Understanding and Synergic KR 2013
Yuliya Lierler, NSF Workshop: Research Challenges and Opportunities in Knowledge Representation (2013).
The Dramatic True Story of the Frame Default 2013
Vladimir Lifschitz, To Appear In Journal of Philosophical Logic (2013).
The Semantics of Gringo and Proving Strong Equivalence 2013
Amelia Harrison, TPLP, Online Supplement (2013). http://journals.cambridge.org/downloadsup.php?file=/tlp2013035.pdf.
Towards a Tight Integration of Syntactic Parsing with Semantic Disambiguation by means of Declarative Programming 2013
Yuliya Lierler and Peter Schueller, 10th International Conference on Computational Semantics (IWCS) (2013).
Relational Theories with Null Values and Non-Herbrand Stable Models 2012
Vladimir Lifschitz, Karl Pichotta, and Fangkai Yang, Theory and Practice of Logic Programming, Vol. 12, 4-5 (2012), pp. 565-582.
A Tarskian Informal Semantics for Answer Set Programming 2012
Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens, International Conference on Logic Programming (ICLP) (2012).
Constraint Answer Set Programming 2012
Yuliya Lierler, ALP newsletter feautured article (2012).
Logic Programs with Intensional Functions 2012
Vladimir Lifschitz, In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR) 2012.
On the Relation of Constraint Answer Set Programming Languages and Algorithms 2012
Yuliya Lierler, AAAI (2012).
Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming 2012
Yuliya Lierler and Peter Schueller, Correct Reasoning: Essays on Logic-based AI (2012). Springer.
Practical and Methodological Aspects of the Use of Cutting-Edge ASP Tools 2012
Marcello Balduccini and Yuliya Lierler, Fourteenth International Symposium on Practical Aspects of Declarative Languages (2012), pp. 78-92.
Representing First-Order Causal Theories by Logic Programs 2012
Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz and Fangkai Yang, Theory and Practice of Logic Programming, Vol. 12, 3 (2012), pp. 383-412.
Surviving Solver Sensitivity: An ASP Practitioner's Guide 2012
Bryan Silverthorn, Yuliya Lierler and Marius Schneider, International Conference on Logic Programming (ICLP) (2012).
The Common Core of Action Languages B and C 2012
Michael Gelfond and Vladimir Lifschitz, In Working Notes of the International Workshop on Nonmonotonic Reasoning (NMR) 2012.
The Frame Problem, Then and Now 2012
Vladimir Lifschitz, unpublished.
Two-valued logic programs 2012
Vladimir Lifschitz, In Technical Communications of the International Conference on Logic Programming 2012.
Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem Oriented Solving 2012
Yuliya Lierler, Shaden Smith, Miroslaw Truszczynski, Alex Westlund, In Fourteenth International Symposium on Practical Aspects of Declarative Languages 2012.
A Transition System for AC Language Algorithms 2011
Yuliya Lierler and Yuanlin Zhang, In Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP), 2011 2011.
Abstract Answer Set Solvers with Backjumping and Learning 2011
Yuliya Lierler, Theory and Practice of Logic Programming (2011).
ASP-Based Problem Solving with Cutting-Edge Tools 2011
Marcello Balduccini and Yuliya Lierler, In Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2011.
Datalog Programs and Their Stable Models 2011
Vladimir Lifschitz, In Datalog Reloaded: First International Workshop, Datalog 2010, Oxford, UK, March 16-19, 2010. Revised Selected Papers, de Moor, O.; Gottlob, G.; Furche, T.; Sellers, A. (Eds.) 2011. Springer...
John McCarthy, 1927-2011: The Scientist Who Set Computers on the Path to Common Sense 2011
Vladimir Lifschitz, Nature (2011), pp. 480.
On Elementary Loops of Logic Programs 2011
Martin Gebser, Joohyung Lee, Yuliya Lierler, Theory and Practice of Logic Programming (2011).
On the Minimality of Stable Models 2011
Paolo Ferraris and Vladimir Lifschitz, In Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, pp. 54-73 2011. Springer.
Stable Models and Circumscription 2011
Paolo Ferraris, Joohyung Lee, and Vladimir Lifschitz, Artificial Intelligence, Vol. 175 (2011), pp. 236--263.
Termination of Grounding is Not Preserved by Strongly Equivalent Transformations 2011
Yuliya Lierler and Vladimir Lifschitz, In Logic Programming and Nonmonotonic Reasoning (LPNMR) 2011.
Transition Systems for Model Generators --- A Unifying Approach 2011
Yuliya Lierler and Miroslaw Truszczynski, In International Conference on Logic Programming (ICLP) 2011.
Yet Another Characterization of Strong Equivalence 2011
Alexander Bochman and Vladimir Lifschitz, In Technical Communications of the 27th International Conference on Logic Programming, pp. 11-15 2011.
Declarative Query Tuning and Optimization using Answer Set Programming 2010
Yuliya Lierler, Philip Cannata , unpublished. Unpublished draft.
From C-Believed Propositions to the Causal Calculator 2010
Vladimir Lifschitz, Heuristic, Probability and Causality: A Tribute to Judea Pearl (2010).
On the Stable Model Semantics of First-Order Formulas with Aggregates 2010
Paolo Ferraris and Vladimir Lifschitz, In Proceedings of the 2010 Workshop on Nonmonotonic Reasoning 2010.
Representing Synonymity in Causal Logic and in Logic Programming 2010
Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz and Fangkai Yang, In Proceedings of International Workshop on Nonmonotonic Reasoning (NMR) 2010.
SAT-Based Answer Set Programming 2010
Yuliya Lierler, PhD Thesis, Department of Computer Sciences, The University of Texas at Austin.
Thirteen Definitions of a Stable Model 2010
Vladimir Lifschitz, In Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of his 70th Birthday 2010.
Translating First-Order Causal Theories into Answer Set Programming 2010
Vladimir Lifschitz and Fangkai Yang, In Proceedings of the European Conference on Logics in Artificial Intelligence (JELIA) 2010.
A Modular Language for Describing Actions 2009
Wanwan Ren, PhD Thesis, University of Texas at Austin.
One More Decidable Class of Finitely Ground Programs 2009
Yuliya Lierler and Vladimir Lifschitz, In Proc. International Conference on Logic Programming (ICLP) 2009.
Symmetric Splitting in the General Theory of Stable Models 2009
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, and Ravi Palla, In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 797-803 2009.
A Library of General-Purpose Action Descriptions 2008
Selim T. Erdoğan, PhD Thesis, Computer Sciences Department, The University of Texas at Austin.
A Reductive Semantics for Counting and Choice in Answer Set Programming 2008
Joohyung Lee, Vladimir Lifschitz, and Ravi Palla, In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 472-479 2008.
Abstract Answer Set Solvers 2008
Yuliya Lierler, In Proceedings of International Conference on Logic Programming (ICLP'08), pp. 377-391 2008. Springer.
Knowledge Representation and Classical Logic 2008
Vladimir Lifschitz, Leora Morgenstern and David Plaisted, In Handbook of Knowledge Representation, Frank van Harmelen and Vladimir Lifschitz and Bruce Porter (Eds.), pp. 3-88 2008. Elsevier.
Knowledge Representation and Question Answering 2008
Marcello Balduccini, Chitta Baral, Yuliya Lierler, In Handbook of Knowledge Representation, Frank van Harmelen and Vladimir Lifschitz and Bruce Porter (Eds.), pp. 779-820 2008. Elsevier.
Safe Formulas in the General Theory of Stable Models (preliminary report) 2008
Joohyung Lee, Vladimir Lifschitz, and Ravi Palla, In International Conference on Logic Programming (ICLP) 2008.
Twelve Definitions of a Stable Model 2008
Vladimir Lifschitz, In Proceedings of International Conference on Logic Programming (ICLP), pp. 37-51 2008.
What Is Answer Set Programming? 2008
Vladimir Lifschitz, In Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1594-1597 2008. MIT Press.
A Characterization of Strong Equivalence for Logic Programs with Variables 2007
Vladimir Lifschitz, David Pearce and Agustin Valverde, In Procedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) 2007.
A Logic Program Characterization of Causal Theories 2007
Paolo Ferraris, In IJCAI 2007.
A New Perspective on Stable Models 2007
Paolo Ferraris, Joohyung Lee and Vladimir Lifschitz, In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 372-379 2007.
Cmodels: SAT-based Answer Set Programming System 2007
Yuliya Lierler and Marco Maratea, In ALP Newsletter 2007.
Expressiveness of Answer Set Languages 2007
Paolo Ferraris, PhD Thesis, Computer Sciences Department, The University of Texas at Austin.
Head-Elementary-Set-Free Logic Programs 2007
Martin Gebser, Joohyung Lee, and Yuliya Lierler, In Logic Programming and Nonmonotonic Reasoning, pp. 149--161 2007.
Inferring Phylogenetic Trees Using Answer Set Programming 2007
Daniel R. Brooks, Esra Erdem, Selim T. Erdogan, James W. Minett, and Donald Ringe, Journal of Automated Reasoning, Vol. 39 (2007), pp. 471-511.
Propositional Theories are Strongly equivalent to Logic Programs 2007
Pedro Cabalar and Paolo Ferraris, Theory and Practice of Logic Programming, Vol. 7 (2007), pp. 745-759.
The Semantics of Variables in Action Descriptions 2007
Vladimir Lifschitz and Wanwan Ren, In Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 1025-1030 2007.
Variables in Action Descriptions: Merging C+ with ADL 2007
Vladimir Lifschitz and Wanwan Ren, In Working Notes of the 8th International Symposium on Logical Formalizations of Commonsense Reasoning (as part of the AAAI Spring Symposium Series), pp. 83--88 2007.
Why the Monkey Needs the Box: a Serious Look at a Toy Domain 2007
Selim T. Erdoğan, Paolo Ferraris, Vladimir Lifschitz and Wanwan Ren, In Working Notes of the 7th IJCAI International Workshop on Nonmonotonic Reasoning, Action and Change (NRAC'07), pp. 57--63 2007.
A Generalization of the Lin-Zhao Theorem 2006
Paolo Ferraris, Joohyung Lee and Vladimir Lifschitz, Annals of Mathematics and Artificial Intelligence, Vol. 47 (2006), pp. 79-101.
A Knowledge Module: Buying and Selling 2006
Joohyung Lee and Vladimir Lifschitz, In Working Notes of the AAAI Symposium on Formalizing Background Knowledge 2006.
A Modular Action Description Language 2006
Vladimir Lifschitz and Wanwan Ren, In Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 853-859 2006.
Actions as Special Cases 2006
Selim T. Erdoğan and Vladimir Lifschitz, In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 377-387 2006.
Answer Set Programming based on Propositional Satisfiability 2006
Enrico Giunchiglia, Yuliya Lierler, and Marco Maratea, Journal of Automated Reasoning, Vol. 36 (2006), pp. 345-377.
Causal Theories as Logic Programs 2006
Paolo Ferraris, In Proceedings of Workshop on Logic Programming 2006.
Elementary Sets for Logic Programs 2006
Martin Gebser, Joohyung Lee, and Yuliya Lierler, In Proceedings of National Conference on Artificial Intelligence (AAAI) 2006.
Eliminating Weight Constraints in Polynomial Time 2006
Paolo Ferraris, unpublished. Unpublished draft.
Experiments with SAT-based Answer Set Programming 2006
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea, and Armando Tacchella, In Search and Logic: Answer Set Programming and SAT, LaSh-06, A Workshop affiliated with ICLP, as part of FLoC 2006.
Model Generation for Generalized Quantifiers via Answer Set Programming 2006
Yuliya Lierler and Guenther Goerz, In 8th Conference on Natural Language Processing (KONVENS) 2006.
Temporal Phylogenetic Networks and Logic Programming 2006
Esra Erdem, Vladimir Lifschitz and Don Ringe, Theory and Practice of Logic Programming, Vol. 6 (2006), pp. 539-558.
Why Are There So Many Loop Formulas? 2006
Vladimir Lifschitz and Alexander Razborov, ACM Transactions on Computational Logic, Vol. 7 (2006), pp. 261-268.
A Model-Theoretic Counterpart of Loop Formulas 2005
Joohyung Lee, In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 503-508 2005. Professional Book Center.
Answer Sets for Propositional Theories 2005
Paolo Ferraris, In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pp. 119-131 2005.
Automated Reasoning about Actions 2005
Joohyung Lee, PhD Thesis, University of Texas at Austin.
Cmodels -- SAT-based Disjunctive Answer Set Solver 2005
Yuliya Lierler, In 8th International Conference on Logic Programming and Nonmonotonic Reasoning 2005.
Cmodels for Tight Disjunctive Logic programs 2005
Yuliya Lierler, In 19th Workshop on (Constraint) Logic Programming W(C)LP 2005, 2005-01 2005. http://www.informatik.uni-ulm.de/epin/pw/11541.
Disjunctive Answer Set Programming via Satisfiability 2005
Yuliya Lierler, In 3rd Intl. Workshop on Answer Set Programming: Advances in Theory and Implementation 2005.
Mathematical Foundations of Answer Set Programming 2005
Paolo Ferraris and Vladimir Lifschitz, In We Will Show Them! Essays in Honour of Dov Gabbay, pp. 615-664 2005. King's College Publications.
On Modular Translations and Strong Equivalence 2005
Paolo Ferraris, In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pp. 79-91 2005.
Weight Constraints as Nested Expressions 2005
Paolo Ferraris and Vladimir Lifschitz, Theory and Practice of Logic Programming, Vol. 5 (2005), pp. 45-74.
Almost Definite Causal Theories 2004
Semra Dogandag, Paolo Ferraris, Vladimir Lifschitz, In Proc. LPNMR-7, pp. 74--86 2004.
Automatic Compilation of Protocol Insecurity Problems into Logic Programming 2004
Alesandro Armando, Luca Compagna, and Yuliya Lierler, In Proceedings of 9th {E}uropean Conference in Logics in Artificial Intelligence (JELIA-04), pp. 617-627 2004. Springer.
Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs 2004
Yuliya Lierler and Marco Maratea, In Procedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pp. 346-350 2004.
Definitions in Answer Set Programming 2004
Selim T. Erdoğan and Vladimir Lifschitz, In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Vladimir Lifschitz and Ilkka Niemel{"a} (Eds.), pp. 114-126 2004.
Goal-Converging Behavior Networks and Self-Solving Planning Domains 2004
Bernhard Nebel and Yuliya Lierler, In 16th European Conference on Artificial Intelligence 2004.
Irrelevant Actions in Plan Generation (extended abstract) 2004
Vladimir Lifschitz and Wanwan Ren, In IX Ibero-American Workshops on Artificial Intelligence, pp. 71-78 2004.
Loop Formulas for Circumscription 2004
Joohyung Lee and Fangzhen Lin, In Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 281-286 2004.
Nondefinite vs. Definite Causal Theories 2004
Joohyung Lee, In Proceedings 7th Int'l Conference on Logic Programming and Nonmonotonic Reasoning, pp. 141-153 2004.
Nonmonotonic Causal Theories 2004
Enrico Giunchiglia, Joohyung Lee, Vladimir Lifschitz, Norman McCain and Hudson Turner, Artificial Intelligence, Vol. 153(1--2) (2004), pp. 49-104.
Representing the Zoo World and the Traffic World in the language of the Causal Calculator 2004
Varol Akman, Selim T. Erdoğan, Joohyung Lee, Vladimir Lifschitz and Hudson Turner, Artificial Intelligence, Vol. 153(1--2) (2004), pp. 105-140.
SAT-Based Answer Set Programming 2004
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea, In Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 61-66 2004.
Computing Answer Sets of a Logic Program via Enumeration of SAT Certificates 2003
Yuliya Lierler and Marco Maratea, In 2nd International Workshop on Answer Set Programming 2003.
Describing Additive Fluents in Action Language C 2003
Joohyung Lee and Vladimir Lifschitz, In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 1079--1084 2003.
Loop Formulas for Disjunctive Logic Programs 2003
Joohyung Lee and Vladimir Lifschitz, In Proceedings of International Conference on Logic Programming (ICLP), pp. 451-465 2003.
Reconstructing the Evolutionary History of Indo-European Languages Using Answer Set Programming 2003
Esra Erdem, Vladimir Lifschitz, Luay Nakhleh and Donald Ringe, In Practical Aspects of Declarative Languages: 5th International Symposium, pp. 160--176 2003.
Reinforcing a Claim in Commonsense Reasoning 2003
Jonathan Campbell and Vladimir Lifschitz, unpublished. In {em Working Notes of the AAAI Spring Symposium on Logical Formalizations of Commonsense Reasoning}.
Tight Logic Programs 2003
Esra Erdem and Vladimir Lifschitz, Theory and Practice of Logic Programming, Vol. 3 (2003), pp. 499-518.
Answer Set Programming and Plan Generation 2002
Vladimir Lifschitz, Artificial Intelligence, Vol. 138 (2002), pp. 39-54.
On Calculational Proofs 2002
Vladimir Lifschitz, Annals of Pure and Applied Logic, Vol. 113 (2002), pp. 207-224.
Theory and Applications of Answer Set Programming 2002
Esra Erdem , PhD Thesis, University of Texas at Austin.
Additive Fluents 2001
Joohyung Lee and Vladimir Lifschitz, unpublished. In {em Working Notes of the AAAI Spring Symposium on Answer Set Programming}.
Fages' Theorem for Programs with Nested Expressions 2001
Esra Erdem and Vladimir Lifschitz, In Proceedings of International Conference on Logic Programming (ICLP), pp. 242-254 2001.
Strongly Equivalent Logic Programs 2001
Vladimir Lifschitz, David Pearce and Agustin Valverde, ACM Transactions on Computational Logic, Vol. 2 (2001), pp. 526-541.
Book review: M. Shanahan, Solving the Frame Problem 2000
Vladimir Lifschitz, Artificial Intelligence, Vol. 123 (2000), pp. 265-268.
Fages' Theorem and Answer Set Programming 2000
Yuliya Lierler, Esra Erdem and Vladimir Lifschitz, In Proceedings of International Workshop on Nonmonotonic Reasoning (NMR), pp. 33-35" ) INPROCEEDINGS(bab00, 2000. Springer.
Getting to the Airport: the Oldest Planning Problem in AI 2000
Vladimir Lifschitz, Norman McCain, Emilio Remolina and Armando Tacchella, In Logic-Based Artificial Intelligence, Jack Minker (Eds.), pp. 147-165 2000. Kluwer.
Missionaries and Cannibals in the Causal Calculator 2000
Vladimir Lifschitz, In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 85-96 2000.
Wire Routing and Satisfiability Planning 2000
Esra Erdem, Vladimir Lifschitz and Martin Wong, In Proceedings of International Conference on Computational Logic, pp. 822-836 2000.
Action Languages, Answer Sets and Planning 1999
Vladimir Lifschitz, In The Logic Programming Paradigm: a 25-Year Perspective, pp. 357-373 1999. Springer Verlag.
Action Languages, Temporal Action Logics and the Situation Calculus 1999
Enrico Giunchiglia and Vladimir Lifschitz, In Working Notes of the IJCAI-99 Workshop on Nonmonotonic Reasoning, Action, and Change 1999.
Answer Set Planning 1999
Vladimir Lifschitz, In Proceedings ICLP-99, pp. 23-37 1999.
Nested Expressions in Logic Programs 1999
Vladimir Lifschitz, Lappoon R. Tang and Hudson Turner, Annals of Mathematics and Artificial Intelligence, Vol. 25 (1999), pp. 369-389.
Representing Transition Systems by Logic Programs 1999
Vladimir Lifschitz and Hudson Turner, In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pp. 92-106 1999.
Success of Default Logic 1999
Vladimir Lifschitz, In Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter, Levesque, Hector and Pirri, Fiora (Eds.), pp. 208-212 1999. Springer.
Transformations of Logic Programs Related to Causality and Planning 1999
Esra Erdem and Vladimir Lifschitz, In Logic Programming and Non-monotonic Reasoning: Proceedings Fifth Int'l Conf. (Lecture Notes in Artificial Intelligence 1730), pp. 107-116 1999.
Action Languages 1998
Michael Gelfond and Vladimir Lifschitz, Electronic Transactions on Artificial Intelligence, Vol. 3 (1998), pp. 195-210.
An Action Language Based on Causal Explanation: preliminary report 1998
Enrico Giunchiglia and Vladimir Lifschitz, In Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 623-630 1998. AAAI Press.
Causal Action Theories and Satisfiability Planning 1998
Hudson Turner, PhD Thesis, University of Texas at Austin.
Satisfiability Planning with Causal Theories 1998
Norman McCain and Hudson Turner, In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), Cohn, Anthony and Schubert, Lenhart and Shapiro, Stuart (Eds.), pp. 212-223 1998.
Situation Calculus and Causal Logic 1998
Vladimir Lifschitz, In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), Cohn, Anthony and Schubert, Lenhart and Shapiro, Stuart (Eds.), pp. 536-546 1998.
Causal Theories of Action and Change 1997
Norman McCain and Hudson Turner, In Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 460-465 1997.
Causality in Commonsense Reasoning about Actions 1997
Norman McCain, PhD Thesis, Computer Sciences Department, The University of Texas at Austin.
On the Logic of Causal Explanation 1997
Vladimir Lifschitz, Artificial Intelligence, Vol. 96 (1997), pp. 451-465.
Representing Action: Indeterminacy and Ramifications 1997
Enrico Giunchiglia, G. Neelakantan Kartha and Vladimir Lifschitz, Artificial Intelligence, Vol. 95 (1997), pp. 409-443.
Representing Actions in Logic Programs and Default Theories: a Situation Calculus Approach 1997
Hudson Turner, Journal of Logic Programming, Vol. 31 (1997), pp. 245-298.
Two Components of an Action Language 1997
Vladimir Lifschitz, Annals of Mathematics and Artificial Intelligence, Vol. 21 (1997), pp. 305-320.
Update by Means of Inference Rules 1997
Teodor Przymusinski and Hudson Turner, Journal of Logic Programming, Vol. 30, 2 (1997), pp. 125-143.
Foundations of Logic Programming 1996
Vladimir Lifschitz , In Principles of Knowledge Representation, Brewka, Gerhard (Eds.), pp. 69-128 1996. CSLI Publications.
Splitting a Default Theory 1996
Hudson Turner, In Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 645-651 1996.
A Causal Theory of Ramifications and Qualifications 1995
Norman McCain and Hudson Turner, In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 1978-1984 1995.
A Mathematical Investigation of Reasoning about Actions 1995
Neelakantan Kartha , PhD Thesis, University of Texas at Austin. (Available by anonymous ftp from ftp.cs.utexas.edu as /pub/techreports/tr95-17.ps).
A Simple Formalization of Actions Using Circumscription 1995
G. Neelakantan Kartha and Vladimir Lifschitz, In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 1970-1975 1995.
Dependent Fluents 1995
Enrico Giunchiglia and Vladimir Lifschitz, In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 1964-1969 1995.
ECWA Made Easy 1995
Vladimir Lifschitz, Annals of Mathematics and Artificial Intelligence, Vol. 14 (1995), pp. 269-274.
From Disjunctive Programs to Abduction 1995
Vladimir Lifschitz and Hudson Turner, In Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 927), Dix, J{"u}rgen and Pereira, Luis and Przymusinski, Teodor (Eds.), pp. 23-42 1995. Springer.
Loop Checking and the Well-founded Semantics 1995
Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski and Robert F. Staerk, In Logic Programming and Non-monotonic Reasoning: Proceedings of the Third Int'l Conf., pp. 127-142 1995.
Nested Abnormality Theories 1995
Vladimir Lifschitz, Artificial Intelligence, Vol. 74 (1995), pp. 351-365.
SLDNF, Constructive Negation and Grounding 1995
Vladimir Lifschitz, In Proceedings ICLP-95, pp. 581-595 1995.
The Logic of Common Sense 1995
Vladimir Lifschitz, ACM Computing Surveys, Vol. 27 (1995), pp. 343-345.
Actions with Indirect Effects (preliminary report) 1994
G. Neelakantan Kartha and Vladimir Lifschitz, In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 341-350 1994.
Autoepistemic Logic and Introspective Circumscription 1994
Michael Gelfond, Vladimir Lifschitz, Halina Przymusinska and Grigori Schwarz, In Theoretical Aspects of Reasoning about Knowledge: Proceedings Fifth Conf., Fagin, Ronald (Eds.), pp. 197-207 1994.
Circumscription 1994
Vladimir Lifschitz, Handbook of Logic in AI and Logic Programming, Vol. 3 (1994), pp. 298--352. Oxford University Press.
Language Independence and Language Tolerance in Logic Programs 1994
Norman McCain and Hudson Turner, In Proceedings Eleventh Int'l Conf. on Logic Programming, Van Hentenryck, Pascal (Eds.), pp. 38-57 1994.
Minimal Belief and Negation as Failure 1994
Vladimir Lifschitz, Artificial IntelligenceGabbay, D.M. and Hogger, C.J. and Robinson, J.A. (Eds.), Vol. 70 (1994), pp. 53--72. Oxford University Press.
Signed Logic Programs 1994
Hudson Turner, In Proceedings ILPS-94, pp. 61-75 1994.
Splitting a Logic Program 1994
Vladimir Lifschitz and Hudson Turner, In Proceedings of International Conference on Logic Programming (ICLP), Van Hentenryck, Pascal (Eds.), pp. 23-37 1994.
A Monotonicity Theorem for Extended Logic Programs 1993
Hudson Turner, In Proceedings Tenth Int'l Conf. on Logic Programming, pp. 567-585 1993.
Extended Logic Programs as Autoepistemic Theories 1993
Vladimir Lifschitz and Grigori Schwarz, In Logic Programming and Non-monotonic Reasoning: Proceedings of the Second Int'l Workshop, Pereira, Luis Moniz and Nerode, Anil (Eds.), pp. 101-114 1993.
Representing Action and Change by Logic Programs 1993
Michael Gelfond and Vladimir Lifschitz, Journal of Logic Programming, Vol. 17 (1993), pp. 301-322.
Restricted Monotonicity 1993
Vladimir Lifschitz, In Proceedings of National Conference on Artificial Intelligence (AAAI), pp. 432-437 1993.
Answer Sets in General Nonmonotonic Reasoning (preliminary report) 1991
Vladimir Lifschitz and Thomas Y. C. Woo, In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, pp. 603--614 1991.
Classical Negation in Logic Programs and Disjunctive Databases 1991
Michael Gelfond and Vladimir Lifschitz, New Generation Computing, Vol. 9 (1991), pp. 365-385.
Disjunctive Defaults 1991
Michael Gelfond, Vladimir Lifschitz, Halina Przymusinska and Miroslaw Truszczynski, In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), Allen, James and Fikes, Richard and Sandewall, Erik (Eds.), pp. 230-237 1991.
Editorial 1991
Vladimir Lifschitz, Journal of Logic and Computation, Vol. 2 (1991), pp. 671--673.
Towards a Metatheory of Action 1991
Vladimir Lifschitz, In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), Allen, James and Fikes, Richard and Sandewall, Erik (Eds.), pp. 376-386 1991.
On Open Defaults 1990
Vladimir Lifschitz, In Computational Logic: Symposium Proceedings, Lloyd, John (Eds.), pp. 80-95 1990. Springer.
Benchmark Problems for Formal Nonmonotonic Reasoning 1989
Vladimir Lifschitz, In Proceedings of the Second international Workshop on Non-monotonic Reasoning, pp. 202--219 1989.
The Stable Model Semantics for Logic Programming 1988
Michael Gelfond and Vladimir Lifschitz, In Proceedings of International Logic Programming Conference and Symposium, Kowalski, Robert and Bowen, Kenneth (Eds.), pp. 1070-1080 1988. MIT Press.
On the Semantics of STRIPS 1987
Vladimir Lifschitz, In Reasoning about Actions and Plans, Georgeff, Michael and Lansky, Amy (Eds.), pp. 1-9, San Mateo, CA 1987. Morgan Kaufmann.
Sup (answer set solver) SUP is a native answer set solver that can be seen as a combination... 2009

MAD (Modular Action Description language) The Modular Action Description language MAD was introduced is a de... 2007

Cmodels (answer set solver) Cmodels is a system that computes answer sets for either disjun... 2003

Ccalc (Causal theory calculator) The Causal Calculator CCalc is a system for representing commonsen... 2000