=======================================================================
*EXTENDED SUBMISSION DEADLINE*
*IMPORTANT DATES (AoE)*
Abstract submission deadline: *30 June 2025 *
Paper submission deadline: *30 June 2025 *
Notification: *20 July 2025 *
=======================================================================
=========================================================================
CALL FOR PAPERS ASPOCP 2025
18th Workshop on Answer Set Programming and Other
Computing Paradigms
https://sites.google.com/view/aspocp-2025/
September 12 - 13,
2025
Affiliated with ICLP 2025, 41th International Conference on
Logic Programming
https://iclp25.demacs.unical.it/
=========================================================================
*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.
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). Furthermore, significant research effort is being
devoted to
delivering ASP-based solutions to real-world problems and end-users. This
includes the development
of visualization and explanation tools, which are becoming increasingly
important for the
acceptance of ASP in practice.
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.
- Debugging and visualization of ASP programs.
- Explanations for ASP or using ASP.
- 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 in the website.
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/conferences/?conf=iclp25 and selecting the
track "Workshop on
Answer Set Programming and Other Computing Paradigm".
*IMPORTANT DATES (AoE)*
Abstract submission deadline: 30 May 2025 *30 June 2025*
Paper submission deadline: 06 June 2025 *30 June 2025*
Notification: 04 July 2025 * 20
July 2025*
*WORKSHOP CO-CHAIRS*
Alice Tarzariol, University of Klagenfurt, Klagenfurt, Austria -
alice.tarzariol@aau.at
Brais Muñiz, University of Coruña, A Coruña, Spain - brais.mcastro@udc.es
*PROGRAM COMMITTEE*
- Mario Alviano, University of Calabria
- Pedro Cabalar, University of Coruña
- Tran Cao, New Mexico State University
- Francesco Cauteruccio, University of Salerno
- Stefania Costantini, University of L'Aquila
- Carmine Dodaro, University of Calabria
- Esra Erdem, Sabanci University
- Cristina Feier, Technical University of Cluj-Napoca
- Johannes K. Fichte, Linköping University
- Tobias Geibinger, Vienna University of Technology
- Giovambattista Ianni, University of Calabria
- Tomi Janhunen, Tampere University
- Vladimir Lifschitz, University of Texas
- Marco Maratea, University of Calabria
- Michael Morak, University of Klagenfurt
- Orkunt Sabuncu, Potassco Solutions Turkey
- Konstantin Schekotihin, University of Klagenfurt
- Van-Giang Trinh, Inria Saclay
- Jia-Huai You, University of Alberta
- Johannes P. Wallner, TU Graz
--
------------------------------------------------------------------------------------------------------------------
Il banner è generato automaticamente dal servizio di posta elettronica
dell'Università della Calabria
<https://www.unical.it/5x1000>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************