<div dir="ltr"><div><br></div><div>[Apologies for multiple postings.]</div><div><br></div><div><br></div><div>=============================================================================== </div><div>                CALL FOR PAPERS                  </div><div>                 ASPOCP 2018                  </div><div>   11th Workshop on Answer Set Programming and Other Computing Paradigms    </div><div>          <a href="https://sites.google.com/site/aspocp2018">https://sites.google.com/site/aspocp2018</a>         </div><div>               July 18, 2018 (Post-FLoC workshop)</div><div>                   </div><div>                                         </div><div>  Affiliated with the 35th International Conference on Logic Programming (ICLP)</div><div>as part of the Federated Logic Conference 2018</div><div>                Oxford, UK                  </div><div>               July 14 - 17, 2018                 </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 (excluding</div><div> references).</div><div><br></div><div> Paper submission will be handled electronically by means of the Easychair system. </div><div> The submission page is available here.</div><div><br></div><div> The submission format is TPLP (Style).</div><div><br></div><div>                                         </div><div>                                         </div><div>IMPORTANT DATES (tentative)                           </div><div> Abstract submission deadline:           April 10, 2018 (tent.)          </div><div> Paper submission deadline:            April 15, 2018 (tent.)          </div><div> Notification:                         May 15, 2018 (tent.)           </div><div> Camera-ready articles due:             May 27, 2018 (tent.)           </div><div> Workshop:                          July 18, 2018</div><div>            </div><div>                                         </div><div>                                         </div><div>PROCEEDINGS                                   </div><div>                                         </div><div> Accepted papers will be made available online as inofficial proceedings with </div><div> CEUR proceedings. The best paper will receive an invitation to the Journal on </div><div> Theory and Practice of Logic Programming (TPLP) as fast track paper. </div><div><br></div><div> A selection of extended and revised versions of accepted papers will appear </div><div> in a special issue. We are currently negotiating with potential journals.</div><div> Such papers will go through a second formal selection process to meet</div><div> the high quality standard of the journal.   </div><div>          </div><div>                                         </div><div>LOCATION</div><div> For details see: <a href="http://www.floc2018.org/local-information/">http://www.floc2018.org/local-information/</a>                                     </div><div> The workshop will be held in Oxford, UK, co-located with          </div><div> the 35th International Conference on Logic Programming (ICLP) as</div><div> as part of the Federated Logic Conference 2018.            </div><div>                                         </div><div>                                         </div><div>WORKSHOP CO-CHAIRS</div><div> Jorge Fandinno, IRIT, Toulouse, France</div><div> Johannes K. Fichte, TU Wien, Austria                                </div><div>                                         </div><div>                                         </div><div>PROGRAM COMMITTEE</div><div>Mario Alviano Department of Mathematics and Computer Science, University of Calabria  </div><div>Marcello Balduccini Saint Joseph's University </div><div>Mutsunori Banbara Information Science and Technology Center, Kobe University, JAPAN </div><div>Bart Bogaerts Katholieke Universiteit Leuven  </div><div>Pedro Cabalar University of Corunna </div><div>Stefania Costantini Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica, Univ. dell'Aquila  </div><div>Marc Denecker Katholieke Universiteit Leuven  </div><div>Carmine Dodaro University of Genova  </div><div>Esra Erdem Sabanci University  </div><div>Wolfgang Faber University of Huddersfield  </div><div>Jorge Fandiño University of Toulouse IRIT/CNRS, Toulouse, France chair</div><div>Johannes K. Fichte TU Wien chair</div><div>Michael Gelfond Texas Tech University </div><div>Enrico Giunchiglia DIST - Univ. Genova </div><div>Amelia Harrison The University of Texas at Austin </div><div>Daniela Inclezan Miami University  </div><div>Tomi Janhunen Aalto University  </div><div>Nicola Leone Department of Mathematics and Computer Science - University of Calabria </div><div>Yuliya Lierler University of Nebraska at Omaha </div><div>Vladimir Lifschitz The University of Texas at Austin </div><div>Marco Maratea DIBRIS, University of Genova  </div><div>Emilia Oikarinen Finnish Institute of Occupational Health  </div><div>Max Ostrowski University of Potsdam </div><div>Axel Polleres Vienna University of Economics and Business - WU Wien </div><div>Francesco Ricca Department of Mathematics and Computer Science University of Calabria </div><div>Javier Romero Universität Potsdam </div><div>Orkunt Sabuncu TED University, Ankara  </div><div>Peter Schüller Marmara University  </div><div>Claudia Schulz TU Darmstadt  </div><div>Mirek Truszczynski Computer Science Department, University of Kentucky </div><div>Concepcion Vidal University of Coruña  </div><div>Antonius Weinzierl Aalto University  </div><div>Stefan Woltran TU Wien </div><div>Jia-Huai You University of Alberta </div><div><br></div></div>