Since its introduction in the late 1980s, Answer Set Progra mming (ASP) has been widely applied to various kno wledge-intensive tasks and combinatorial search pr oblems. The relationship of ASP to other computing paradigms, such as constraint satisfaction, quant ified Boolean formulas (QBF), Constraint Logic Pro gramming (CLP), first-order logic (FOL), and FO(ID ) is the subject of active research. Furthermore, the practical applications of ASP also foster work on multi-paradigm problem-solving, and in particu lar language and solver integration. A large body of general results regarding ASP is available and several efficient ASP solvers have been implemente d. However, there are still significant challenges in applying ASP to real life applications, and mo re interest in relating ASP to other computing par adigms is emerging. This workshop, affiliated with FLOC 2022, will provide opportunities for re searchers to identify these challenges and to exch ange ideas for overcoming them.
\nThe workshop invites two types of submi ssions: - original papers describing original rese arch. - non-original paper already published on fo rmal proceedings or journals. Original papers must not exceed 13 pages (excluding references) and mu st be formatted using the 1-column CEURART style. Authors are requested to clearly specify whether t heir submission is original or not with a footnote on the first page. Authors are invited to submit their manuscripts in PDF via the EasyChair system.
\n