Answer set programming (ASP) is a programming methodology oriented towards combinatorial search problems. ASP is a form of declarative programming: an ASP program describes what is counted as a solution to the problem, but does not specify an algorithm for solving it.
Vladimir Lifschitz is a Professor of Computer Science at the University of Texas at Austin and a Fellow of the Association for the Advancement of Artificial Intelligence. He received a degree in Mathematics from the Steklov Mathematical Institute in Leningrad, USSR in 1971. A few years later he came to the United States, and his research interests turned to computational logic and knowledge representation. Lifschitz has written over 60 papers on logic programming, coined the term “answer set programming," and received several awards for publications in this area, including a Most Influential Paper in 20 Years Award and a Test of Time Award from the Association for Logic Programming. Lifschitz has served as the Editor-in-Chief of ACM Transactions on Computational Logic and as a member of the Editorial Board of the journal Artificial Intelligence.
Innehållsförteckning
Introduction.- Input Language of CLINGO.- Combinatorial Search.- Propositional Programs and Minimal Models.- Programs with Negation.- Mathematics of Stable Models.- More about the Language of CLINGO.- Dynamic Systems.- Conclusion.