[DL] ASPOCP 2017 (Espoo, Finland - Colocated with LPNMR 2017) -- Second call for papers
aspocp at gmail.com
Tue Mar 14 11:24:04 CET 2017
[Apologies for multiple postings.]
[html version on https://easychair.org/cfp/ASPOCP2017]
[*NEW* We have reached an agreement with Annals of Mathematics and
Artificial Intelligence (http://www.springer.com/computer/ai/journal/10472)
to publish a special issue with extended versions of selected papers (see
CALL FOR PAPERS
10th Workshop on Answer Set Programming and Other Computing Paradigms
July 3, 2017
Affiliated with the 14th International Conference on Logic Programming
July 3 - 6, 2017
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) research direction).\\
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
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 in
Springer LNAI/LNCS format
Paper submission will be handled electronically by
means of the Easychair system. The submission page is available here
IMPORTANT DATES (tentative)
Abstract and paper submission deadline: April 3, 2017
Notification: May 1,
Camera-ready articles due: May 22, 2017
Workshop: July 3, 2017
Accepted papers will be made available online.
A selection of extended and revised versions of accepted papers will
in a special issue of Annals of Mathematics and Artificial Intelligence
(http://www.springer.com/computer/ai/journal/10472), provided that a
amount of high quality papers is collected.
Such papers will go through a second formal selection process to meet
the high quality standard of the journal.
The workshop will be held in Espoo, Finland, collocated with
the International Conference on Logic Programming and Nonmonotonic
Reasoning (LPNMR) 2017.
Bart Bogaerts, KU Leuven, Flanders, Belgium
Amelia Harrison, University of Texas at Austin, USA
PROGRAM COMMITTEE (to be completed)
Marcello Balduccini, Drexel University
Bart Bogaerts (chair), KU Leuven
Pedro Cabalar, University of Corunna
Sandeep Chintabathina, Hawaii Pacific University
Stefania Costantini, Dipartimento di Ingegneria e Scienze
dell'Informazione e Matematica Univ. dell'Aquila
Marc Denecker, KU Leuven
Marina De Vos, University of Bath
Esra Erdem, Sabanci University
Wolfgang Faber, University of Huddersfield
Cristina Feier, University of Bremen
Johannes Klaus Fichte, Institute of Information Systems Vienna University
Enrico Giunchiglia, DIST - Univ. Genova
Amelia Harrison (chair), University of Texas
Daniela Inclezan, Miami University
Tomi Janhunen, Aalto University
Joohyung Lee, Arizona State University
Nicola Leone, Department of Mathematics and Computer Science - University
Vladimir Lifschitz, University of Texas
Marco Maratea, DIBRIS University of Genova
Alessandro Mosca, SIRIS Lab - Research division of SIRIS Academic SL
Max Ostrowski, University of Potsdam
David Pearce, Universidad Politecnica de Madrid
Axel Polleres, Vienna University of Economics and Business
Guillermo Simari, Dept. of Computer Science and Engineering Universidad
Nacional del Sur in Bahia Blanca
Mirek Truszczynski, Computer Science Department University of Kentucky
Richard Watson, Texas Tech University Department of Computer Science
Stefan Woltran, TU Wien
Jia-Huai You, Department of Computing Science University of Alberta
Edmonton Alberta Canada
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the dl