Special issue on answer set programming

摘要

Since its introduction, answer set programming (ASP) has been widely applied to various knowledge-intensive tasks and combinatorial search problems. ASP was found to be closely related to SAT, which has led to new methods of computing answer sets using SAT solvers and techniques adapted from SAT. While this has been the most studied relationship, the relationship of ASP to other computing paradigms, such as constraint satisfaction, quantified boolean formulas (QBF), or first-order logic (FOL) is also the subject of active research. The goal of the annual ASPOCP (acronym for ASP and Other Computing Paradigms) workshop is to facilitate the discussion about crossing the boundaries of current ASP techniques, in combination with or inspired by other computing paradigms.