<div dir="ltr"><div style="font-size:12.8px">[Apologies for multiple postings.]</div><div style="font-size:12.8px">[html version on <a href="https://easychair.org/cfp/ASPOCP2017" target="_blank">https://easychair.org/cfp/<wbr>ASPOCP2017</a>]</div><div style="font-size:12.8px"><br></div><div style="font-size:12.8px"><br></div><div style="font-size:12.8px">[<b>NEW</b> We have <span style="font-size:12.8px">reached an </span><span class="gmail-il" style="font-size:12.8px">agreement</span><span style="font-size:12.8px"> with Annals of Mathematics and </span></div><div style="font-size:12.8px"><span style="font-size:12.8px">Artificial Intelligence (</span><a href="http://www.springer.com/computer/ai/journal/10472" rel="noreferrer" target="_blank" style="font-size:12.8px">http://www.springer.com/compu<wbr>ter/ai/journal/10472</a><span style="font-size:12.8px">) </span></div><div style="font-size:12.8px"><span style="font-size:12.8px">to publish a special issue with extended versions of selected papers (see below).]</span></div><div style="font-size:12.8px"><span style="font-size:12.8px"><br></span></div><div style="font-size:12.8px"><span style="font-size:12.8px"><br></span></div><div style="font-size:12.8px"><div style="color:rgb(0,0,0);font-family:arial,verdana,sans-serif;font-size:13.3333px"><span style="background-color:transparent;font-size:10pt">=============================================================================== </span></div><div style="color:rgb(0,0,0);font-family:arial,verdana,sans-serif;font-size:13.3333px"><div>                               CALL FOR PAPERS                                  </div><div>                                 ASPOCP 2017                                    </div><div>     10th Workshop on Answer Set Programming and Other Computing Paradigms      </div><div>                    <a href="https://sites.google.com/site/aspocp2017">https://sites.google.com/site/aspocp2017</a>                    </div><div>                              July 3, 2017                                      </div><div>                                                                                </div><div>   Affiliated with the 14th International Conference on Logic Programming and   </div><div>                            Nonmonotonic Reasoning                              </div><div>                                Espoo, Finland                                  </div><div>                               July 3 - 6, 2017                                 </div><div>                                                                                </div><div>=============================================================================== </div><div>                                                                                </div><div>AIMS AND SCOPE                                                                  </div><div>                                                                                </div><div> Since its introduction in the late 1980s, Answer Set Programming (ASP)         </div><div> has been widely applied to various knowledge-intensive tasks and               </div><div> combinatorial search problems. ASP was found to be closely related to          </div><div> SAT, which led to a new method of computing answer sets using SAT              </div><div> solvers and techniques adapted from SAT. This has been a much                  </div><div> studied relationship, and is currently extended towards                        </div><div> satisfiability modulo theories (SMT). The relationship of ASP to other         </div><div> computing paradigms, such as constraint satisfaction, quantified               </div><div> Boolean formulas (QBF), Constraint Logic Programming (CLP),                    </div><div> first-order logic (FOL), and FO(ID) is also the subject of active              </div><div> research. Consequently, new methods of computing answer sets are being         </div><div> developed based on relationships to these formalisms.\\                        </div><div>                                                                                </div><div> Furthermore, the practical applications of ASP also foster work on             </div><div> multi-paradigm problem-solving, and in particular language and solver          </div><div> integration. The most prominent examples in this area currently are            </div><div> the integration of ASP with description logics (in the realm of the            </div><div> Semantic Web) and constraint satisfaction (which recently led to               </div><div> the Constraint Answer Set Programming (CASP) research direction).\\            </div><div>                                                                                </div><div> A large body of general results regarding ASP is available and                 </div><div> several efficient ASP solvers have been implemented. However, there            </div><div> are still significant challenges in applying ASP to real life                  </div><div> applications, and more interest in relating ASP to other computing             </div><div> paradigms is emerging. This workshop will provide opportunities for            </div><div> researchers to identify these challenges and to exchange ideas for             </div><div> overcoming them.                       </div><div><br></div><div>TOPICS                                                                          </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> - Hybridizing ASP with procedural approaches.                                  </div><div> - Enhanced grounding or beyond grounding.                                      </div><div>                                                                                </div><div>                                                                                </div><div>SUBMISSIONS                                                                        </div><div> Papers must describe original research and should not exceed 13 pages in the   </div><div> <a href="https://www.springer.com/gp/authors-editors/conference-proceedings/conference-proceedings-guidelines" rel="nofollow" style="color:rgb(85,26,139)">Springer LNAI/LNCS format</a><span style="background-color:transparent;font-size:10pt">. Paper submission </span><span style="background-color:transparent;font-size:10pt">will be handled electronically by </span></div><div><span style="background-color:transparent;font-size:10pt"> means of the Easychair system. The </span><span style="background-color:transparent;font-size:10pt">submission page is available <a href="https://easychair.org/conferences/?conf=aspocp2017" rel="nofollow" style="color:rgb(85,26,139)">here</a>.  </span><span style="background-color:transparent;font-size:10pt">      </span></div><div>                                                                                </div><div>                                                                                </div><div>IMPORTANT DATES (tentative)                                                     </div><div> Abstract and paper submission deadline:      April 3, 2017                     </div><div> Notification:                                                   May 1, 2017                       </div><div> Camera-ready articles due:                          May 22, 2017                      </div><div> Workshop:                                                    July 3, 2017                      </div><div>                                                                                </div><div>                                                                                </div><div>PROCEEDINGS                                                                     </div><div>                                                                                </div><div> Accepted papers will be made available online.       </div><div><br></div><div><div> A selection of extended and revised versions of accepted papers will appear </div><div> in a special issue of Annals of Mathematics and Artificial Intelligence</div><div> (<a href="http://www.springer.com/computer/ai/journal/10472">http://www.springer.com/computer/ai/journal/10472</a>), provided that a sufficient </div><div> amount of high quality papers is collected.</div></div><div><br></div><div> Such papers will go through a second formal selection process to meet</div><div><span style="background-color:transparent"> the high quality standard of the journal.</span>                        </div><div>                                                                                </div><div>LOCATION                                                                        </div><div> The workshop will be held in Espoo, Finland, collocated with                  </div><div> the International Conference on Logic Programming and Nonmonotonic             </div><div> Reasoning (LPNMR) 2017.                                                        </div><div>                                                                                </div><div>                                                                                </div><div>WORKSHOP CO-CHAIRS                                                              </div><div> Bart Bogaerts, KU Leuven, Flanders, Belgium                                    </div><div> Amelia Harrison, University of Texas at Austin, USA                            </div><div>                                                                                </div><div>                                                                                </div><div><div><span style="background-color:transparent;font-size:10pt">PROGRAM COMMITTEE (to be completed)</span></div><div> Marcello Balduccini, Drexel University</div><div> Bart Bogaerts (chair), KU Leuven</div><div> Pedro Cabalar, University of Corunna </div><div> Sandeep Chintabathina, Hawaii Pacific University</div><div> Stefania Costantini, Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica  Univ. dell'Aquila </div><div> Marc Denecker, KU Leuven </div><div> Marina De Vos, University of Bath</div><div> Esra Erdem, Sabanci University </div><div> Wolfgang Faber, University of Huddersfield </div><div> Cristina Feier, University of Bremen </div><div> Johannes Klaus Fichte, Institute of Information Systems  Vienna University of Technology </div><div> Enrico Giunchiglia, DIST - Univ. Genova </div><div> Amelia Harrison (chair), University of Texas</div><div> Daniela Inclezan, Miami University </div><div> Tomi Janhunen, Aalto University </div><div> Joohyung Lee, Arizona State University</div><div> Nicola Leone, Department of Mathematics and Computer Science - University of Calabria </div><div> Vladimir Lifschitz, University of Texas </div><div> Marco Maratea, DIBRIS University of Genova </div><div> Alessandro Mosca, SIRIS Lab - Research division of SIRIS Academic SL </div><div> Max Ostrowski, University of Potsdam</div><div> David Pearce, Universidad Politecnica de Madrid</div><div> Axel Polleres, Vienna University of Economics and Business </div><div> Guillermo Simari, Dept. of Computer Science and Engineering  Universidad Nacional del Sur in Bahia Blanca </div><div> Mirek Truszczynski, Computer Science Department  University of Kentucky </div><div> Richard Watson, Texas Tech University  Department of Computer Science </div><div> Stefan Woltran, TU Wien </div><div> Jia-Huai You, Department of Computing Science  University of Alberta Edmonton  Alberta  Canada </div></div></div></div></div>