ASPOCP 2026 is a workshop of ICLP 2026, taking place on the first week of the
9th Federated Logic Conference (FLOC) in Lisbon, Portugal

ASPOCP 2026 is the 19th workshop of its kind, following ASPOCP 2008, ASPOCP 2009, ASPOCP 2010, ASPOCP 2011, ASPOCP 2012, ASPOCP 2013, ASPOCP 2014, ASPOCP 2015, ASPOCP 2016, ASPOCP 2017, ASPOCP 2018, ASPOCP 2019, ASPOCP 2020, ASPOCP 2021, ASPOCP 2022, ASPOCP 2023, ASPOCP 2024 , ASPOCP 2025

AIM 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. The workshop is also a place for developers of solvers to present their work and to foster a place for fruitful discussions.

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.