[Apologies
for cross-posting]
==============================
SECOND CALL FOR PAPERS
ASPOCP 2024
17th Workshop on Answer Set Programming and Other
Computing Paradigms
https://sites.google.com/
October 12 or October 13
Affiliated with ICLP 2024, 40th International Conference
on Logic Programming
https://www.iclp24.utdallas.
October 11 - 17, 2024
==============================
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 overcoming them.
TOPICS
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 other paradigms.
- 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.
SUBMISSIONS
The workshop invites two types of submissions:
- original papers describing original research.
- non-original paper already published on formal proceedings
or journals.
Original papers must not exceed 13 pages (excluding references)
and must be formatted using the 1-column CEURART style available here.
A ready-to-clone overleaf project containing a 1-column CEURART
style is available here.
Authors are requested to clearly specify whether their
submission is original or not with a footnote on the first page.
Authors are invited to submit their manuscripts in PDF via the
EasyChair system at the link: https://easychair.org/
IMPORTANT DATES
Abstract submission deadline: 01
August 2024
Paper submission deadline: 08
August 2024
Notification: 05
September 2024
PROCEEDINGS
Authors of all accepted original contributions can opt to
publish their work in formal proceedings.
Accepted non-original contributions will be given visibility on
the conference web site including a link to the original
publication, if already published.
A selection of extended and revised versions of accepted papers
could appear in a special issue.
Extended versions of accepted non-original contributions, if
not published in a journal yet, might be included in the issue.
WORKSHOP CO-CHAIRS
Francesco Pacenza, Department of Mathematics and Computer
Science, University of Calabria, Italy
Zeynep G. Saribatur, Institute of Logic and Computation, TU
Wien, Austria
PROGRAM COMMITTEE
Mario Alviano, University of Calabria Marcello Balduccini, Saint Joseph's University Pedro Cabalar, University of Corunna Francesco Cauteruccio, University of Salerno Stefania Costantini, University of L'Aquila Carmine Dodaro, University of Calabria Stefan Ellmauthaler, TU Dresden Esra Erdem, Sabanci University Wolfgang Faber, University of Klagenfurt Cristina Feier Johannes K. Fichte, Linköping University Martin Gebser, University of Klagenfurt Tobias Geibinger, TU Wien Markus Hecher, Massachusetts Institute of Technology Giovambattista Ianni, University of Calabria Daniela Inclezan, Miami University Tomi Janhunen, Tampere University Vladimir Lifschitz, The University of Texas at Austin Marco Maratea, University of Calabria Tran Cao Son, New Mexico State University Alice Tarzariol, University of Klagenfurt Johannes P. Wallner, TU Graz Stefan Woltran, TU Wien Jia-Huai You, University of Alberta Jessica Zangari, University of Calabria