Seventh ASPOCP International Workshop on ‘Answer Set Programming and Other Computing Paradigms’
Daniela Inclezan, Marco Maratea · Journal of Logic and Computation · 2015
The Answer Set Programming (ASP) logic programming paradigm was introduced in the late 1990s, based on the answer set semantics of logic programs proposed by Gelfond and Lifschitz a decade earlier. To date, ASP has been applied to a variety of domains and demonstrated its suitability for solving knowledge-intensive tasks and combinatorial search problems, in particular. One direction of ASP research focuses on the development of efficient methods for computing answer sets. Novel techniques were initially adapted from SAT, which led to the introduction of satisfiability modulo theories. More recently, ideas have been derived from the study of the relationship between ASP and other computing paradigms, such as constraint satisfaction, quantified boolean formulas, first-order logic, pseudo-boolean solvers, theorem provers. A second line of work in the ASP community investigates multi-paradigm problem-solving for practical applications, which has resulted so far in the integration of ASP with description logics, constraint satisfaction and external means of computation.