<div dir="ltr">
<div><br></div><div>*** Apologies for multiple copies ***</div>
<div><br>
</div>
<div>
<div dir="auto">
<pre>=======================================================================</pre>
</div>
<div dir="auto"><br>
</div>
<div dir="auto"><b>EXTENDED SUBMISSION DEADLINE</b></div>
<div dir="auto"><b><br>
</b></div>
<div dir="auto"><b>IMPORTANT DATES (AoE)</b></div>
<div dir="auto"><br>
</div>
<div dir="auto">Abstract submission deadline: <b>30 June 2025 </b></div>
<div dir="auto">Paper submission deadline: <b>30 June 2025 </b></div>
<div dir="auto">Notification: <b>20 July 2025 </b></div>
<div dir="auto"><br>
</div>
<div dir="auto">
<pre>=======================================================================</pre>
</div>
<br>
</div>
<div>========================================================================= </div>
<div><br>
</div>
<div> CALL FOR PAPERS ASPOCP 2025 </div>
<div> 18th Workshop on Answer Set Programming and Other Computing Paradigms </div>
<div><span style="white-space:pre-wrap"></span> <a href="https://sites.google.com/view/aspocp-2025/" target="_blank">https://sites.google.com/view/aspocp-2025/</a> </div>
<div> September 12 - 13, 2025 </div>
<div><br>
</div>
<div> </div>
<div> Affiliated with ICLP 2025, 41th International Conference on Logic Programming</div>
<div> <a href="https://iclp25.demacs.unical.it/" target="_blank">https://iclp25.demacs.unical.it/</a></div>
<div><br>
</div>
<div> </div>
<div>========================================================================= </div>
<div> </div>
<div><b>AIMS AND SCOPE </b> </div>
<div> </div>
<div> Since its introduction in the late 1980s, Answer Set Programming (ASP) has been widely applied to </div>
<div> various knowledge-intensive tasks and combinatorial search problems. ASP was found to be</div>
<div> closely related to SAT, which led to a new method of computing answer sets using SAT solvers and</div>
<div> techniques adapted from SAT. This has been a much studied relationship, and is currently extended</div>
<div> towards satisfiability modulo theories (SMT). The relationship of ASP to other computing paradigms,</div>
<div> such as constraint satisfaction, quantified Boolean formulas (QBF), Constraint Logic Programming</div>
<div> (CLP), first-order logic (FOL), and FO(ID) is also the subject of active research. Consequently, new</div>
<div> methods of computing answer sets are being developed based on relationships to these formalisms. </div>
<div> </div>
<div> The practical applications of ASP also foster work on multi-paradigm problem-solving, </div>
<div> and in particular language and solver integration. The most prominent examples in this area</div>
<div> currently are the integration of ASP with description logics (in the realm of the Semantic Web) and</div>
<div> constraint satisfaction (which recently led to the Constraint Answer Set Programming (CASP)</div>
<div> research direction). Furthermore, significant research effort is being devoted to </div>
<div> delivering ASP-based solutions to real-world problems and end-users. This includes the development</div>
<div> of visualization and explanation tools, which are becoming increasingly important for the </div>
<div> acceptance of ASP in practice. </div>
<div> </div>
<div> A large body of general results regarding ASP is available and several efficient ASP solvers have</div>
<div> been implemented. However, there are still significant challenges in applying ASP to real life</div>
<div> applications, and more interest in relating ASP to other computing paradigms is emerging. This </div>
<div> workshop will provide opportunities for researchers to identify these challenges and to exchange</div>
<div> ideas for overcoming them. </div>
<div><br>
</div>
<div><b>TOPICS</b> </div>
<div> </div>
<div> Topics of interests include (but are not limited to): </div>
<div> - ASP and classical logic formalisms (SAT/FOL/QBF/SMT/DL). </div>
<div> - ASP and constraint programming. </div>
<div> - ASP and other logic programming paradigms, e.g., FO(ID). </div>
<div> - ASP and other nonmonotonic languages, e.g., action languages. </div>
<div> - ASP and external means of computation. </div>
<div> - ASP and probabilistic reasoning. </div>
<div> - ASP and knowledge compilation. </div>
<div> - ASP and machine learning. </div>
<div> - New methods of computing answer sets using algorithms or systems of </div>
<div> other paradigms. </div>
<div> - Language extensions to ASP. </div>
<div> - ASP and multi-agent systems. </div>
<div> - ASP and multi-context systems. </div>
<div> - Modularity and ASP. </div>
<div> - ASP and argumentation. </div>
<div> - Multi-paradigm problem solving involving ASP. </div>
<div> - Evaluation and comparison of ASP to other paradigms. </div>
<div> - ASP and related paradigms in applications. </div>
<div> - Debugging and visualization of ASP programs.</div>
<div> - Explanations for ASP or using ASP. </div>
<div> - Hybridizing ASP with procedural approaches. </div>
<div> - Enhanced grounding or beyond grounding. </div>
<div> </div>
<div> </div>
<div><b>SUBMISSIONS </b> </div>
<div><br>
</div>
<div> The workshop invites two types of submissions:</div>
<div> - original papers describing original research.</div>
<div> - non-original paper already published on formal proceedings or journals.</div>
<div> Original papers must not exceed 13 pages (excluding references) and must be formatted using </div>
<div> the 1-column CEURART style available in the website.</div>
<div><br>
</div>
<div> Authors are requested to clearly specify whether their submission is original or not with a </div>
<div> footnote on the first page.</div>
<div> Authors are invited to submit their manuscripts in PDF via the EasyChair system at the </div>
<div> link: <a href="https://easychair.org/conferences/?conf=iclp25" target="_blank">https://easychair.org/conferences/?conf=iclp25</a> and selecting the track "Workshop on </div>
<div> Answer Set Programming and Other Computing Paradigm".</div>
<div><br>
</div>
<div><br>
</div>
<div><b>IMPORTANT DATES (AoE)</b></div>
<div><br>
</div>
<div> Abstract submission deadline: <strike>30 May 2025</strike> <b>30 June 2025</b></div>
<div> Paper submission deadline: <strike> 06 June 2025</strike> <b>30 June 2025</b></div>
<div> Notification: <strike>04 July 2025</strike> <b> 20 July 2025</b></div>
<div>
</div>
<div><b>WORKSHOP CO-CHAIRS</b></div>
<div><br>
</div>
<div> Alice Tarzariol, University of Klagenfurt, Klagenfurt, Austria - <a href="mailto:alice.tarzariol@aau.at" target="_blank">alice.tarzariol@aau.at</a></div>
<div> Brais Muñiz, University of Coruña, A Coruña, Spain - <a href="mailto:brais.mcastro@udc.es" target="_blank">brais.mcastro@udc.es</a></div>
<div><br>
</div>
<div><b>PROGRAM COMMITTEE</b></div>
<div><b><br>
</b></div>
<div>
<div>- Mario Alviano, University of Calabria</div>
<div>- Pedro Cabalar, University of Coruña</div>
<div>- Tran Cao, New Mexico State University</div>
<div>- Francesco Cauteruccio, University of Salerno</div>
<div>- Stefania Costantini, University of L'Aquila</div>
<div>- Carmine Dodaro, University of Calabria</div>
<div>- Esra Erdem, Sabanci University</div>
<div>- Cristina Feier, Technical University of Cluj-Napoca</div>
<div>- Johannes K. Fichte, Linköping University</div>
<div>- Tobias Geibinger, Vienna University of Technology</div>
<div>- Giovambattista Ianni, University of Calabria</div>
<div>- Tomi Janhunen, Tampere University</div>
<div>- Vladimir Lifschitz, University of Texas</div>
<div>- Marco Maratea, University of Calabria</div>
<div>- Michael Morak, University of Klagenfurt</div>
<div>- Orkunt Sabuncu, Potassco Solutions Turkey</div>
<div>- Konstantin Schekotihin, University of Klagenfurt</div>
<div>- Van-Giang Trinh, Inria Saclay</div>
<div>- Jia-Huai You, University of Alberta</div>
<div>- Johannes P. Wallner, TU Graz</div></div>
<br></div>
<br>
<div style="font-family:Arial,Helvetica,sans-serif;font-size:1.3em">------------------------------<span></span><span></span><span></span><span></span><span></span><span></span><wbr>------------------------------<span></span><span></span><span></span><span></span><span></span><span></span><wbr>------------------------------<span></span><span></span><span></span><span></span><span></span><span></span><wbr>------------------------</div><div><font face="Arial, Helvetica, sans-serif"><span style="font-size:13px">Il banner è generato automaticamente dal servizio di posta elettronica dell'Università della Calabria</span></font></div><div><font face="Arial, Helvetica, sans-serif"><span style="font-size:13px"><a href="https://www.unical.it/5x1000" target="_blank"><img src="https://www.unical.it/media/medias/2024/5X1000_2024_mail_ok_20.webp" alt="https://www.unical.it/5x1000"></a><br></span></font></div>