2011 41st IEEE International Symposium on Multiple-Valued Logic (2011)
May 23, 2011 to May 25, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISMVL.2011.61
Answer Set Programming (ASP) is a declarative programming paradigm targeted to solving search problems. The basic idea of ASP is similar to, for example, SAT-based planning or constraint satisfaction problems but ASP provides a more powerful knowledge representation language for effective problem encoding. A number of successful ASP systems have already been developed and applied in a large range of areas. The talk explains the theoretical underpinnings of ASP, introduces the answer set programming paradigm, outlines computational techniques used in current ASP solvers, and discusses some interesting applications of the approach.
answer set programming, search problems, constraint satisfaction, propositional satisfiability
I. Niemelä, "Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems," 2011 41st IEEE International Symposium on Multiple-Valued Logic(ISMVL), Tuusula, Finland, 2011, pp. 139-141.