Workshops
The ICLP conference series has a long standing tradition of hosting rich set of co-located workshops. ICLP workshops provide a unique opportunity for the presentation and discussion of work that can be preliminary in nature, novel ideas, and new open problems to a wide
and interested audience.
Co-located workshops also provide an opportunity for presenting specialized topics and opportunities for intensive discussions and project collaboration. The topics of the workshops co-located with ICLP 2023 can cover any areas related to logic programming (e.g., theory, implementation, environments, language issues, alternative paradigms, applications), including cross-disciplinary areas. However, any relevant workshop proposal will be considered.
The format of the workshop will be decided by the workshop organizers, but ample time should be allowed for general discussion. Workshops can vary in length, but the optimal duration will be half a day or a full day.
Location
Workshops will be collocated with ICLP 2023, at Imperial College, London, UK. See the Venue page for details.
Workshops will take place during the week of July 9-15, with exact days TBA:
List of Accepted Workshops
Proponents: Francesco Pacenza, Zeynep G. Saribatur
Estimated duration: 1 day
Description:
ASPOCP 2023 is the 16th workshop on “Answer Set Programming and Other Computing Paradigms”. It aims to facilitate the discussion about crossing the boundaries of current ASP techniques, in combination with or inspired by other computing paradigms. Furthermore, it provides opportunities for researchers to identify the challenges in applying ASP to real life applications, and to exchange ideas for overcoming them.
Proponents: Gopal Gupta, Joaquín Arias, Elmer Salazar
Estimated duration: 1/2 - 1 day
Description:
Answer Set Programming (ASP) is a successful extension of logic programming for solving combinatorial problems as well as knowledge representation and reasoning problems. Most current implementations of ASP work by grounding a program and using a SAT-solver like technology to find the answer sets. While this approach is extremely efficient, relying on grounding of the program leads to significant blow up of the program size, while computing the whole model makes finding justification of an atom in the model hard. This limits the applicability of ASP to problems dealing with large knowledge bases. Goal-directed or query-driven execution strategies have been proposed that do not require any grounding. However, these novel implementation approaches present a new set of challenges. The goal of this workshop is to foster discussion around challenges and opportunities that such approaches present.
Proponents: Sotirios Batsakis, Emmanouil Papadakis, Livio Robaldo, Ilias Tachmazidis, Adam Wyner
Estimated duration: Half Day
Proponents: Kilian Rückschloß, Felix Weitkämper
Estimated duration: Half Day
Proponents: C Henrik R Åslund, Francesco Belardinelli, Elizabeth Black, Francis Rhys Ward, El Mahdi El Mhamdi
Estimated duration: 1 day
Description:
The second STAI workshop is focused on the broad area of safe and trustworthy AI.
Proponents: Roberta Calegari, Antonis Kakas, Ken Satoh
Estimated duration: 1 day
Description:
Abduction and Argumentation have been studied in Logic Programming (LP) since the very early part of 1990. Today they form an integral part of Explainable AI and the aim of neural-symbolic integration. Most of the systems for Abduction and Argumentation have implementations in Logic Programming with these being used to develop prototype applications. The proposed workshop will offer the opportunity to take a retrospective stock of the link between LP and these two forms of reasoning while at the same time considering how LP enables their application in realistic AI problems.
Proponents: Kristijonas Čyra, Timotheus Kampik, Oana Cocarascu, Antonio Rago
Estimated duration: 1 day
Description:
Computational argumentation is considered a particularly promising paradigm for facilitating explainable AI (XAI), and one that has deep roots in logic programming (LP). Given the substantial interest in different facets of XAI in the context of argumentation and LP, this workshop aims at providing a forum for focused discussions of the recent developments on the topic. The workshop will feature works and discussions on diverse perspectives of argumentative and LP explainability. Specifically, we will cover the formal foundations of explaining argumentative inferences and argumentative properties of explanations, as well as applications of argumentation to facilitate explainability, with an extended focus on LP-based inference and explanations. The event will appeal to a wide range of researchers including: the growing sector of the core argumentation community that works on explainable argumentation; those working on explainability in the context of other approaches to defeasible reasoning, particularly LP; as well as to applied researchers who intend to use computational argumentation or LP for explainability purposes.
Proponents: Emily LeBlanc, Francesco Fabiano, Joost Vennekens, Tran Cao Son, Pedro Cabalar, Jorge Fandiño, Marcello Balduccini, Brais Muñiz
Estimated duration: 1 day
Proponents: Floriana Grasso, Nancy Green, Jodi Schneider, Simon Wells
Estimated duration: 1 day
Description:
Since its inception in 2001, the CMNA workshop series has focused upon the issue of modelling “natural” argumentation, where naturalness may range across a variety of forms, perhaps involving the use of visual rather than linguistic means to illustrate a point, for example using graphics or multimedia, or applying more sophisticated rhetorical devices, interacting at various layers of abstraction, or exploiting “extra-rational” characteristics of the audience, taking into account emotions and affective factors.
AI has witnessed a prodigious growth in uses of argumentation throughout many of its subdisciplines: agent system negotiation protocols that demonstrate higher levels of sophistication and robustness; argumentation-based models of evidential relations and legal processes that are more expressive; groupwork tools that use argument to structure interaction and debate; computer-based learning tools that exploit monological and dialogical argument structures in designing pedagogic environments; decision support systems that build upon argumentation theoretic models of deliberation to better integrate with human reasoning; and models of knowledge engineering structured around core concepts of argument to simplify knowledge elicitation and representation problems. Furthermore, benefits have not been unilateral for AI, as demonstrated by the increasing presence of AI scholars in classical argumentation theory events and journals, and AI implementations of argument finding application in both research and pedagogic practice within philosophy and argumentation theory.
To celebrate our co-location with ICLP, this year we have introduced a special theme on explorations of the relationship between logic programming and computational models of natural argument. Our theme should be interpreted broadly, to reflect the wide range of approaches to recognising, formalising, and understanding the richness of real-world reasoning and communication processes within computational models.
Proponents: Michael Morak, Jorge Fandiño
Estimated participants: 20
Estimated duration: Half Day
Proponents: Abeer Dyoub, Fabio Aurelio D’Asaro, Francesca A. Lisi
Estimated duration: Half Day
Description:
3rd WORKSHOP ON MACHINE ETHICS AND EXPLAINABILITY - THE ROLE OF LOGIC PROGRAMMING
This workshop aims to convene researchers working on all aspects of machine ethics and explainability, including theoretical work, system implementations, and applications. Particularly, works involving Logic Programming based solutions and approaches. For more information about the workshop and the topics of interest, please refer the web page: https://sites.google.com/view/meande-lp2023/
Workshop organizers may find further information on the Workshop Organization page
Workshop Chair
Wolfgang Faber - wolfgang.faber@aau.at