A Glimpse of Answer Set Programming
Christian Anger, Kathrin Konczak, Thomas Linke, Torsten H. Schaub · publish.UP (University of Potsdam) · 2005
Answer Set Programming (ASP) is a declarative paradigm for solving search problems appearing in knowledge representation and reasoning. To solve a problem, a programmer designs a logic program so that models of the program determine solutions to the problem. ASP has been identified in the late 1990s as a subarea of logic programming and is becoming one of the fastest growing fields in knowledge representation and declarative programming. Major advantages of ASP are (1) its simplicity, (2) its ability to model effectively incomplete specifications and closure constraints, and (3) its relation to constraint satisfaction and propositional satisfiability, which allows one to take advantage of advances in these areas when designing solvers for ASP systems.