[DL] ASPOCP 2018 --- Call for papers
Jorge.Fandinno at irit.fr
Mon Mar 18 15:43:17 CET 2019
[Apologies for multiple postings]
CALL FOR PAPERS
12th Workshop on Answer Set Programming and Other Computing Paradigms
June 3 or 4, 2018 (LPNMR Workshop)
Affiliated with 15th International Conference on Logic Programming and Nonmonotonic Reasoning,
Saint Joseph’s University, Philadelphia, PA (USA)
June 4-7, 2019
AIMS AND SCOPE
Since its introduction in the late 1980s, Answer Set Programming (ASP) has been widely applied to
various knowledge-intensive tasks and combinatorial search problems. ASP was found to be
closely related to SAT, which led to a new method of computing answer sets using SAT solvers and
techniques adapted from SAT. This has been a much studied relationship, and is currently extended
towards satisfiability modulo theories (SMT). The relationship of ASP to other computing paradigms,
such as constraint satisfaction, quantified Boolean formulas (QBF), Constraint Logic Programming
(CLP), first-order logic (FOL), and FO(ID) is also the subject of active research. Consequently, new
methods of computing answer sets are being developed based on relationships to these formalisms.
Furthermore, the practical applications of ASP also foster work on multi-paradigm problem-solving,
and in particular language and solver integration. The most prominent examples in this area
currently are the integration of ASP with description logics (in the realm of the Semantic Web) and
constraint satisfaction (which recently led to the Constraint Answer Set Programming (CASP)
A large body of general results regarding ASP is available and several efficient ASP solvers have
been implemented. However, there are still significant challenges in applying ASP to real life
applications, and more interest in relating ASP to other computing paradigms is emerging. This
workshop will provide opportunities for researchers to identify these challenges and to exchange
ideas for overcoming them.
Topics of interests include (but are not limited to):
- ASP and classical logic formalisms (SAT/FOL/QBF/SMT/DL).
- ASP and constraint programming.
- ASP and other logic programming paradigms, e.g., FO(ID).
- ASP and other nonmonotonic languages, e.g., action languages.
- ASP and external means of computation.
- ASP and probabilistic reasoning.
- ASP and knowledge compilation.
- ASP and machine learning.
- New methods of computing answer sets using algorithms or systems of
- Language extensions to ASP.
- ASP and multi-agent systems.
- ASP and multi-context systems.
- Modularity and ASP.
- ASP and argumentation.
- Multi-paradigm problem solving involving ASP.
- Evaluation and comparison of ASP to other paradigms.
- ASP and related paradigms in applications.
- Hybridizing ASP with procedural approaches.
- Enhanced grounding or beyond grounding.
Papers must describe original research and should not exceed 13 pages (excluding
Submissions must be written in English, present original research, and be formatted according to Springer’s guidelines and technical instructions available at:
Paper submission will be handled electronically by means of the Easychair system.
The submission page is available here
IMPORTANT DATES (tentative)
Abstract submission deadline: March 26, 2019
Paper submission deadline: April 1, 2019
Notification: May 1, 2019
Camera-ready articles due: May 12, 2019
Workshop: June 3 or 4, 2019
Accepted papers will be made available online as inofficial proceedings with
A selection of extended and revised versions of accepted papers will appear
in a special issue. We are currently negotiating with potential journals.
Such papers will go through a second formal selection process to meet
the high quality standard of the journal.
Saint Joseph’s University, Philadelphia, PA (USA)
Jorge Fandinno, IRIT, Toulouse, France
Johannes K. Fichte, TU Wien, Austria
Amelia Harrison The University of Texas at Austin
Anne Siegel IRISA, CNRS
Antti Hyvärinen USI
Bart Bogaerts Vrije Universiteit Brussel
Bernhard Bliem University of Helsinki
Carmine Dodaro University of Genova
Chitta Baral Arizona State University
Cristina Feier University of Bremen
Daniela Inclezan Miami University
Enrico Giunchiglia University Genova
Fangkai Yang Maana Inc.
Francesco Ricca University of Calabria
Guillermo R. Simari Universidad del Sur in Bahia Blanca
Javier Romero University of Potsdam
Jia-Huai You University of Alberta
Joao Leite Universidade NOVA de Lisboa
Johannes K. Fichte TU Dresden
Johannes P. Wallner Vienna University of Technology
Joohyung Lee Arizona State University
Jörg Pührer Leipzig University
Jorge Fandiño IRIT, University of Toulouse, CNRs
Marc Denecker Katholieke Universiteit Leuven
Marcello Balduccini Saint Joseph's University
Marco Maratea University of Genova
Mario Alviano University of Calabria
Markus Hecher Vienna University of Technology
Martin Gebser University of Potsdam
Max Ostrowski University of Potsdam
Michael Gelfond Texas Tech University
Mirek Truszczynski University of Kentucky
Mutsunori Banbara IKobe University,
Nicola Leone University of Calabria
Orkunt Sabuncu TED University, Ankara
Pedro Cabalar University of Corunna
Richard Watson Texas Tech University, Department of Computer Science
Stefan Ellmauthaler Leipzig University
Stefan Woltran Vienna University of Technology
Stefania Costantini University of Aquila
Tomi Janhunen Aalto University
Tran Cao Son New Mexico State University
Vladimir Lifschitz The University of Texas at Austin
Wolfgang Faber Alpen-Adria-Universität Klagenfurt
Yusuf Izmirlioglu Sabanci University
More information about the dl