ASPOCP 2020

13th Workshop on Answer Set Programming and Other Computing Paradigms

September 18, 2020

ASPOCP 2020 is a workshop of ICLP 2020 to be held September 18-25, 2020 in University of Calabria, Rende, Italy.

ASPOCP 2020 is the 13th workshop of its kind, following ASPOCP 2008, ASPOCP 2009, ASPOCP 2010, ASPOCP 2011, ASPOCP 2012, ASPOCP 2013, ASPOCP 2014, ASPOCP 2015, ASPOCP 2016, ASPOCP 2017, ASPOCP 2018, and ASPOCP 2019.

NOTE ABOUT COVID-19: ASPOCP will be a fully virtual workshop.

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 led to a new method of computing answer sets using SAT solvers and techniques adapted from SAT. This has been a much studied relationship, and is currently extended towards satisfiability modulo theories (SMT). The relationship of ASP to other computing paradigms, such as constraint satisfaction, quantified Boolean formulas (QBF), Constraint Logic Programming (CLP), first-order logic (FOL), and FO(ID) is also the subject of active research. Consequently, new methods of computing answer sets are being developed based on relationships to these formalisms. Furthermore, the practical applications of ASP also foster 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 (which recently led to the Constraint Answer Set Programming (CASP) research direction).  

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