International Conference on Logic Programming

ICLP/LPNMR Workshops

October 12 – 13, 2024, Dallas, USA

 

Workshops on Saturday (October 12)

 

ASPOCP’24: Answer Set Programming and Other Computing Paradigms

Workshop Chairs: Francesco Pacenza, Zeynep G. Saribatur
Estimated duration: 1 day
Description:

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

GDE’24: Goal-directed Execution of Answer Set Programs

Workshop Chairs: Kinjal Basu, Sarat Chandra Varanasi
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.

PIPs’24: Prolog Improvement Proposals

Workshop Chairs: Carl Andersen, Manuel Hermegildo, Jose Morales, Theresa Swift, David Warren, Jan Wielemaker.
Estimated duration: 1/2 day
Description:

Prolog Improvement Proposals (PIPs) are a new approach to standardization that differs from ISO but is complementary to it. Inspired by efforts such as Python’s PEPs (Python Enhancement Proposals), PIPs are intended to be descriptive rather than proscriptive. Examples of PIPs that are recently completed or under development are the JANUS Python interface, static and dynamic dictionaries, and a JSON interface specification. This half-day workshop will offer Prolog implementers and users a chance to understand and comment on the process of PIP creation so that they can adapt it to their own interests. The workshop will begin with a review of the current PIP process and of recently developed PIPs. Next, there will be a chance for implementers of Prologs to present short descriptions of features of their systems that they believe would benefit other sytems. We hope that a result of this workshop will be a wider use of the new Prolog Implementers Forum so that newer PIPs can be proposed, developed, reviewed, and adopted by the Prolog community at large. In order include as many implementers and interested users as possible we plan to conduct this as a hybrid conference.

 

Workshops on Sunday (October 13)

 

PEG 2024: Prolog Education Workshop

Workshop Chairs: Verónica Dahl (Chair), Jacinto Dávila, Wlodek Drabent, Christian Jendreiko, Bob Kowalski, José F. Morales, David Scott Warren
Estimated duration: 1 day
Description:

PEG 2024 is an initiative of the Prolog Education Group 2.0 (PEG 2.0) https://prologyear.logicprogramming.org/Education.html, which aims to promote the use of Prolog-like computing to make logical reasoning and trustworthy coding skills more universally available. PEG 2.0 builds upon a nearly 50-year history of developing educational materials for using logic programming languages such as Prolog and ASP to introduce children in primary and secondary schools to both logic and computing. It also includes the insights and innovations developed for teaching Prolog at university level in both Computing and non- Computing courses. We seek papers on: how to teach Prolog and the logic programming paradigm how to teach STEM and non-STEM subjects through Prolog teaching experiences with the above, including statistical evaluations.

LPOP’24: Logic and Practice of Programming (Integrating Reasoning Systems for Trustworthy AI)

Workshop Chairs: Anil Nerode, Yanhong (Annie) Liu
Estimated duration: 1 day
Description:

Logic is fundamental in programming. In particular, logic programming has seen great successes in challenging application areas such as deductive databases, program analysis, and security. However, programming in practice has been dominated by imperative programming instead of declarative programming. The workshop on Logic and Practice of Programming (LPOP) aims to bring together the best people from multiple areas related to programming with logic, and programming in practice, in order to discuss the integration of declarative and imperative programming. The ultimate goal is to improve programming with logic for the practice of programming and improve the practice of programming with logic. LPOP encourages participants to contribute the best state-of-the-art in all related areas and discuss ideas for general and specific research directions in integrating declarative and imperative programming. The goal is to better understand the current situation and find the best approaches going forward.

PLP’24: Probabilistic Logic Programming

Workshop Chairs: Damiano Azzolini, Markus Hecher
Estimated duration: 1 day
Description:

The workshop encompasses all aspects of combining logic, algorithms, programming and probability. Probabilistic logic programming (PLP) approaches have received much attention in the last few years since they address the need to reason about relational domains under uncertainty. Some applications domains are bioinformatics, the semantic web, robotics, and many more. Furthermore, the current interest in neuro-symbolic integration has shed new light on PLP. PLP is part of a wider current interest in probabilistic programming. It builds upon and benefits from the large body of existing work in logic programming, both in semantics and implementation, but also presents new challenges to the field. While PLP has already contributed a number of formalisms and systems, many questions remain open. As is traditional in this series, the workshop would be designed to foster exchange between the various communities relevant to probabilistic logic programming, including probabilistic programming and statistical relational artificial intelligence.