Answer Set Programming
Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable model (answer set) semantics of logic programming. In ASP, search problems are reduced to computing stable models, and answer set solvers — programs for generating stable models—are used to perform search. The computational process employed in the design of many answer set solvers is an enhancement of the DPLL algorithm and, in principle, it always terminates (unlike Prolog query evaluation, which may lead to an infinite loop). (http://en.wikipedia.org/wiki/Answer_set_programming)
Publications
     [Expand to show all 83][Minimize]
Transforming Gringo Rules into Formulas in a Natural Way 2021
Vladimir Lifschitz, In Proceedings of European Conference on Logics in Artificial Intelligence, 2021.
anthem: Transforming gringo Programs into First-Order Theories (Preliminary Report) 2018
Vladimir Lifschitz, Patrick Lühne, Torsten Schaub, In Working Notes of the Workshop on Answer Set Programming and Other Computing Paradigms 2018.
Interview to Kunstliche Intelligenz 2018
Vladimir Lifschitz, Kunstliche Intelligenz (2018).
Answer Sets and the Language of Answer Set Programming 2016
Vladimir Lifschitz, AI Magazine (2016).
A Direct Proof of Hosoi's Theorem (Extended Abstract) 2015
Amelia Harrison, Vladimir Lifschitz, David Pearce, and Agustin Valverde, In Abstracts of Papers Presented at the Third St. Petersburg Days of Logic and Computability 2015.
On Equivalence of Infinitary Formulas under the Stable Model Semantics 2015
Amelia Harrison, Vladimir Lifschitz and Miroslaw Truszczynski, Theory and Practice of Logic Programming , Vol. 15, 1 (2015).
The Dramatic True Story of the Frame Default 2015
Vladimir Lifschitz, Journal of Philosophical Logic, Vol. 44, 2 (2015), pp. 163--176.
The Semantics of Gringo and Infinitary Propositional Formulas 2014
Amelia Harrison, Vladimir Lifschitz and Fangkai Yang, In Proceedings of 14th International Conference on Principles of Knowledge Representation and Reasoning (KR) 2014.
Action Language BC: Preliminary Report 2013
Joohyung Lee, Vladimir Lifschitz, and Fangkai Yang, In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI) 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).
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) 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.
Representing Actions in Logic-based Languages 2013
Fangkai Yang, To Appear In TPLP, Online Supplement (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.
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.
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.
On Elementary Loops of Logic Programs 2011
Martin Gebser, Joohyung Lee, Yuliya Lierler, Theory and Practice of Logic Programming (2011).
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.
SAT-Based Answer Set Programming 2010
Yuliya Lierler, PhD Thesis, Department of Computer Sciences, The University of Texas at Austin.
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 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.
What Is Answer Set Programming? 2008
Vladimir Lifschitz, In Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1594-1597 2008. MIT Press.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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 2000. Springer.
Action Languages, Answer Sets and Planning 1999
Vladimir Lifschitz, In The Logic Programming Paradigm: a 25-Year Perspective, pp. 357-373 1999. Springer Verlag.
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.
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.
Foundations of Logic Programming 1996
Vladimir Lifschitz , In Principles of Knowledge Representation, Brewka, Gerhard (Eds.), pp. 69-128 1996. CSLI Publications.
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.
Software/Data
Borg

The borg project includes a practical algorithm...

2011