Aims and Scope

Since its introduction in the late 1980s, 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 a new method 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. New methods of computing answer sets are being
developed based on the relation between ASP and other paradigms, such
as the use of pseudo-Boolean solvers, QBF solvers, and FOL theorem
provers. Furthermore, the practical application of ASP also fosters
work on multi-paradigm problem-solving, and in particular language and
solver integration. The most prominent examples in this area currently
are the integration of ASP with description logics (in the realm of
the Semantic Web) and constraint satisfaction. This workshop will
facilitate the discussion about crossing the boundaries of current ASP
techniques, in combination with or inspired by other computing
paradigms.

Topics of interests include (but are not limited to):

Relating ASP to classical logic formalisms (SAT/FOL/QBF/SMT/DL).

Relating ASP to constraint programming.

Relating ASP to other logic programming paradigms.

Relating ASP to other nonmonotonic languages.

New methods of computing answer sets using algorithms or
systems of other paradigms.