posted by organizer: mhecher || 1351 views || tracked by 1 users: [display]

ASPOCP 2020 : 13th Workshop on Answer Set Programming and Other Computing Paradigms


When Sep 17, 2020 - Sep 18, 2020
Where AoE
Abstract Registration Due Jul 11, 2020
Submission Deadline Jul 13, 2020
Notification Due Jul 30, 2020
Final Version Due Sep 2, 2020
Categories    logic   logic programming

Call For Papers

13th Workshop on Answer Set Programming and Other Computing Paradigms
September 17 or 18, 2020 (ICLP Workshop)

Affiliated with 36th International Conference on Logic Programming,
University of Calabria, Rende, Italy
September 18-24, 2020



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 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.


The workshop invites two types of submissions:
papers describing original research,
non-original papers already published on formal proceedings or journals.
Original papers must not exceed 13 pages (excluding references) and must be formatted using the Springer LNCS style 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:

All dates are 'Anywhere on Earth', namely 23:59 UTC-12
Abstract submission deadline: July 11, 2020 (extended)
Paper submission deadline: July 13, 2020 (extended)
Notification: July 30, 2020 (extended)
Camera-ready articles due: September 2, 2020 (extended)
Workshop: September 17 or 18, 2020


Authors of all accepted original contributions can opt for to publish their work on 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 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.
Extended versions of accepted non-original contributions, if not published in a journal yet, might be included in the issue.

University of Calabria, Rende, CS, Italy

Jessica Zangari, University of Calabria, Italy
Markus Hecher, TU Wien, Austria

Anne Siegel
Antti Hyvärinen
Christoph Redl
Cristina Feier
Daniela Inclezan
David Pearce
Enrico Giunchiglia
Esra Erdem
Francesco Calimeri
Giovambattista Ianni
Guillermo R. Simari
Johannes K. Fichte
Johannes P. Wallner
Katsumi Inoue
Marcello Balduccini
Marco Maratea
Marina De Vos
Mario Alviano
Michael Morak
Mirek Truszczynski
Mutsunori Banbara
Orkunt Sabuncu
Pedro Cabalar
Sarah Alice Gaggl
Sebastian Schellhorn
Simona Perri
Stefan Ellmauthaler
Stefan Woltran
Stefania Costantini
Tomi Janhunen
Tran Cao Son
Vladimir Lifschitz
Zeynep G. Saribatur

Related Resources

PROLE 2022   XXI Jornadas sobre Programación y Lenguajes
SYNASC 2022   24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
CFMAI 2022   2022 4th International Conference on Frontiers of Mathematics and Artificial Intelligence (CFMAI 2022)
EXPRESS/SOS 2022   Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics
ISCAI 2022   2022 4th International Symposium on Computing and Artificial Intelligence (ISCAI 2022)
TIME 2022   29th International Symposium on Temporal Representation and Reasoning
VSI: IPMC2022 EMERGING 2022   Special Issue on Emerging Information Processing and Management Paradigms: Edge Intelligence, Federated Learning, and Blockchain
EBL 2022   20th EBL: XX Encontro Brasileiro de Lógica - XX Brazilian Logic Conference
IEA/AEI 2022   35th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems
RP 2022   Reachability Problems