<div dir="ltr">Please accept our apologies for crossposting.<div><br></div><div><span style="background-color:transparent;font-size:10pt;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif">=============================================================================== </span><br style="color:rgb(97,97,97);font-family:"Open Sans";font-size:14px"><span style="background-color:transparent;text-align:center;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px">                                                                  CALL FOR PAPERS</span><span style="color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px;text-align:center">                                                                  </span><br style="color:rgb(97,97,97);font-family:"Open Sans";font-size:14px"><span style="background-color:transparent;text-align:center;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px">                                                                       ASPOCP 2020                             </span><br style="color:rgb(97,97,97);font-family:"Open Sans";font-size:14px"><span style="background-color:transparent;text-align:center;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px">                    13th Workshop on Answer Set Programming and Other Computing Paradigms</span><span style="color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px;text-align:center">                       </span><span style="background-color:transparent;text-align:center;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px">    </span><br style="color:rgb(97,97,97);font-family:"Open Sans";font-size:14px"><span style="background-color:transparent;text-align:center;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px">                                                  <a href="https://sites.google.com/site/aspocp2020">https://sites.google.com/site/aspocp2020</a>                 </span><br style="color:rgb(97,97,97);font-family:"Open Sans";font-size:14px"><span style="background-color:transparent;text-align:center;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px">                                                      September 17 or 18, 2020 (ICLP Workshop</span><span style="background-color:transparent;text-align:center;font-size:10.88px;color:rgb(0,33,71);font-family:"Open Sans",sans-serif">)</span><br style="color:rgb(97,97,97);font-family:"Open Sans";font-size:14px"><span style="background-color:transparent;text-align:center;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px">                                     </span><br style="color:rgb(97,97,97);font-family:"Open Sans";font-size:14px"><span style="background-color:transparent;text-align:center;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:13.3333px">                                                                                </span><br style="color:rgb(97,97,97);font-family:"Open Sans";font-size:14px"><font face="arial, sans-serif" size="2" style="color:rgb(97,97,97)"><span style="text-align:center;color:rgb(0,0,0);background-color:transparent">                                </span><span style="text-align:center;color:rgb(0,0,0);background-color:transparent">Affiliated with 36</span><span style="text-align:center;color:rgb(0,0,0);background-color:transparent">th International Conference on Logic Programming</span><span style="text-align:center;color:rgb(0,0,0);background-color:transparent">,</span><br><span style="text-align:center;color:rgb(0,0,0);background-color:transparent">                                                     </span><span style="text-align:center;color:rgb(0,0,0);background-color:transparent">University of Calabria, Rende, Italy</span></font><div style="color:rgb(97,97,97);font-family:"Open Sans";font-size:14px"><span style="text-align:center;color:rgb(0,0,0);background-color:transparent"><font face="arial, sans-serif" size="2">                                                                  September 18-24, 2020</font></span><div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent">                                                                                </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">=============================================================================== </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">AIMS AND SCOPE                                                                  </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> Since its introduction in the late 1980s, Answer Set Programming (ASP) <span style="background-color:transparent">has been widely applied to </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> various knowledge-intensive tasks and </span><span style="background-color:transparent">combinatorial search problems. ASP was found to be</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> closely related to </span><span style="background-color:transparent">SAT, which led to a new method of computing answer sets using SAT </span><span style="background-color:transparent">solvers and</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> techniques adapted from SAT. This has been a much </span><span style="background-color:transparent">studied relationship, and is currently extended</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> towards </span><span style="background-color:transparent">satisfiability modulo theories (SMT). The relationship of ASP to other </span><span style="background-color:transparent">computing paradigms,</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> such as constraint satisfaction, quantified </span><span style="background-color:transparent">Boolean formulas (QBF), Constraint Logic Programming</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> (CLP), </span><span style="background-color:transparent">first-order logic (FOL), and FO(ID) is also the subject of active </span><span style="background-color:transparent">research. Consequently, new</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> methods of computing answer sets are being </span><span style="background-color:transparent">developed based on relationships to these formalisms.                        </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> Furthermore, the practical applications of ASP also foster work on<span style="background-color:transparent"> multi-paradigm problem-solving, </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> and in particular language and solver </span><span style="background-color:transparent">integration. The most prominent examples in this area</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> currently are </span><span style="background-color:transparent">the integration of ASP with description logics (in the realm of the </span><span style="background-color:transparent">Semantic Web) and</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> constraint satisfaction (which recently led to </span><span style="background-color:transparent">the Constraint Answer Set Programming (CASP)</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> research direction).            </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> A large body of general results regarding ASP is available and <span style="background-color:transparent">several efficient ASP solvers have</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> been implemented. However, there </span><span style="background-color:transparent">are still significant challenges in applying ASP to real life</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> applications, and more interest in relating ASP to other computing </span><span style="background-color:transparent">paradigms is emerging. This </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> workshop will provide opportunities for</span><span style="background-color:transparent"> researchers to identify these challenges and to exchange</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> ideas for </span><span style="background-color:transparent">overcoming them.                       </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><br></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">TOPICS                                                                          </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> Topics of interests include (but are not limited to):                          </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and classical logic formalisms (SAT/FOL/QBF/SMT/DL).                     </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and constraint programming.                                              </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and other logic programming paradigms, e.g., FO(ID).                     </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and other nonmonotonic languages, e.g., action languages.                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and external means of computation.                                       </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and probabilistic reasoning.                                             </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and knowledge compilation.                                               </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and machine learning.                                                    </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - New methods of computing answer sets using algorithms or systems of          </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">   other paradigms.                                                             </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - Language extensions to ASP.                                                  </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and multi-agent systems.                                                 </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and multi-context systems.                                               </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - Modularity and ASP.                                                          </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and argumentation.                                                       </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - Multi-paradigm problem solving involving ASP.                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - Evaluation and comparison of ASP to other paradigms.                         </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - ASP and related paradigms in applications.                                   </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - Hybridizing ASP with procedural approaches.                                  </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> - Enhanced grounding or beyond grounding.                                      </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">SUBMISSIONS                                                                        </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><br></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><div><div><div><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small"> The workshop invites two types of submissions:</span><br style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small"></div><div><ul style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small"><li><span style="background-color:transparent">papers describing original research,</span></li><li>non-original papers already published in formal proceedings or journals.</li></ul><p style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small"> <span style="background-color:transparent">Original papers must not exceed 13 pages (excluding references) and must be formatted using the Springer LNCS style <span style="font-family:arial,sans-serif;color:rgb(51,51,51);background-color:transparent">available <a href="https://www.google.com/url?q=https%3A%2F%2Fwww.springer.com%2Fgp%2Fauthors-editors%2Fconference-proceedings%2Fconference-proceedings-guidelines&sa=D&sntz=1&usg=AFQjCNEOBJFchoTBb0lD6mXKRH8jl9zxzw" style="color:rgb(131,94,165);text-decoration-line:none">here</a></span></span>.</p><p style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small"> Authors are requested to clearly specify whether their submission is original or not with <span style="background-color:transparent">a footnote on the first page.</span></p><p style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small"> Authors are invited to submit their manuscripts in PDF via the EasyChair system at the link:<br></p><p style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small;margin-left:40px"><a href="https://www.google.com/url?q=https%3A%2F%2Feasychair.org%2Fconferences%2F%3Fconf%3Daspocp2020&sa=D&sntz=1&usg=AFQjCNGjonIC5u--M3a_9t0jpz3WVXmY-g" target="_blank" style="color:rgb(85,26,139);text-decoration-line:none;background-color:transparent;font-size:10pt;font-family:Arial,Verdana,sans-serif">https://easychair.org/conferences/?conf=aspocp2020</a><span style="background-color:transparent;font-size:10pt;color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif">.</span><br></p></div></div></div><div><div> IMPORTANT DATES</div><div><em><strong>  All dates are 'Anywhere on Earth', namely 23:59 UTC-12</strong></em></div><div><div>  Abstract <span style="background-color:transparent;font-size:10pt">submission deadline:                    </span><b><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small;background-color:transparent">July 11, 2020 </span><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small;background-color:transparent"><span style="background-color:transparent">(extended)</span></span></b></div><div>  Paper submission deadline:                       <span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small"> </span><b><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small;background-color:transparent">July 13, 2020 </span><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small;background-color:transparent"><span style="background-color:transparent">(extended)</span></span></b></div><div>  Notification:                                               <span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small;background-color:transparent">July 30</span><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small;background-color:transparent">, 2020 (extended)</span></div><div>  Camera-ready articles due:                         <span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small;background-color:transparent">September 2, 2020 (extended)</span></div><div><b>  Workshop:                                               September 17 or 18, 2020</b>                     <br></div></div></div></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                               <br></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><em><strong><br></strong></em></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                             <br></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">PROCEEDINGS                                                                     </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small"> Authors of all accepted original contributions can opt for to publish their work on formal proceedings. </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small"> Accepted non-original contributions will be given visibility on the conference web site including a link to the original publication, if already published.</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><br></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><div> A selection of extended and revised versions of accepted papers will appear in a special issue. We are currently negotiating with potential journals.</div></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> Such papers will go through a second formal selection process to meet<span style="background-color:transparent"> the high quality standard of the journal.<br></span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent"> Extended versions </span><span style="color:rgb(34,34,34);font-family:Arial,Helvetica,sans-serif;font-size:small;background-color:transparent">of accepted non-original contributions, if not published in a journal yet, might be included in the issue.</span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                   </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">LOCATION</div><div style="color:rgb(0,0,0)"><span style="text-align:center"><font face="arial, sans-serif" size="2"> University of Calabria, Rende, CS, Italy</font></span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="font-size:10pt;background-color:transparent">                     </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                                                                                            <br></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">WORKSHOP CO-CHAIRS</div><div><font color="#000000" face="Arial, Verdana, sans-serif"><span style="font-size:13.3333px"> Jessica Zangari</span></font><span style="color:rgb(0,0,0);font-family:Arial,Verdana,sans-serif;font-size:10pt;background-color:transparent">, </span><span style="background-color:transparent;white-space:nowrap"><font color="#222222" face="arial, sans-serif" size="2">University of Calabria, Italy</font></span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"> Markus Hecher, TU Wien, Austria                                                              </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent;font-size:10pt">                                                                                </span></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif">                                                                                </div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><span style="background-color:transparent;font-size:10pt">PROGRAM COMMITTEE<br></span></div></div></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><font face="arial, sans-serif" size="2"> Anne Siegel<br> Antti Hyvärinen<br> Christoph Redl<br> Cristina Feier<br> Daniela Inclezan<br> David Pearce<br> Enrico Giunchiglia</font></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><font face="arial, sans-serif" size="2"> </font><font face="arial, sans-serif" size="2"><font face="arial, sans-serif" size="2">Esra Erdem</font></font></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><font face="arial, sans-serif" size="2"><font face="arial, sans-serif" size="2"> </font>Francesco Calimeri<br> Giovambattista Ianni<br> Guillermo R. Simari<br> Johannes K. Fichte<br> Johannes P. Wallner<br> Katsumi Inoue<br> Marcello Balduccini<br> Marco Maratea<br> Marina De Vos<br> Mario Alviano<br> Michael Morak<br> Mirek Truszczynski<br> Mutsunori Banbara<br> Orkunt Sabuncu<br> Pedro Cabalar<br> Sarah Alice Gaggl<br> Sebastian Schellhorn<br> Simona Perri<br> Stefan Ellmauthaler<br> Stefan Woltran<br> Stefania Costantini</font></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><font face="arial, sans-serif" size="2"> Tomi Janhunen</font></div><div style="color:rgb(0,0,0);font-size:13.3333px;font-family:Arial,Verdana,sans-serif"><font face="arial, sans-serif" size="2"> Tran Cao Son<br> Vladimir Lifschitz<br> Zeynep G. Saribatur</font></div></div></div>