Invited Speakers

Verónica Dahl

12 October 2024

Title: The transformational power of non-monotonic reasoning

Abstract:

We argue that NMR has an inherent power of transformation that has been under-exploited in LP, due to  what could be called LP's "analysis bias": a problem is solved, or knowledge is extracted, from a typically static snapshot of reality at a given time. 

We examine the reaches of overcoming this bias around the goal of making the world more equitably human-friendly. We argue that  to achieve the societal evolution needed to reach this goal, we will need to pay more attention to LP’s capabilities for NMR-aided generation, as opposed to analysis, in combination with a) the development of world patrimony knowledge repositories where properties such as truth can be certified, and b) societal literacy tools for relevant subjects not sufficiently taught at schools, such as inclusive history, civic education or media literacy. We illustrate our arguments around three projects that, in different ways, take such an approach: 

 

N.B. Project 3 will be discussed in much more detail at PEG 2.0 on October 13, see https://prolog-lang.org/Education/PrologEducationWS2024.html - do not miss it!

Torsten Schaub

13 October 2024

Title: What's cooking at Potassco?

Abstract:

Answer Set Programming (ASP) has evolved significantly and is now widely adopted in both academia and industry. This broader adoption presents new challenges and opportunities for ASP researchers and developers. This talk explores the lessons learned from applying ASP to real-world industrial applications at Potassco Solutions GmbH. We will discuss how these experiences have shaped our understanding of ASP and led to new research directions, focusing on the  foundational and tooling challenges encountered when meeting the diverse needs of our users. Ultimately, our goal is to simplify the use of ASP and empower users to effectively solve complex problems.

Moshe Vardi

14 October 2024

09:00-10:00

Title: Logic Programming and Logical Algorithmics

Abstract:

Logic programming, born around 1972, expresses a program as a set of Horn clauses. Computation is then performed by applying logical reasoning to that set of clauses. The approach was eventually described as "Algorithm=Logic+Control". Another approach to logic and algorithms was developed by Codd in the early 1970s. In his approach, the problem domain is expressed as a relational database, and the problem is expressed as a first-order formula, called "query". Computation is performed by a meta-algorithm, the query-evaluation algorithm.  In this talk, I will describe this approach, which I call Logical Algorithmics, in detail. I will show how this approach yielded multi-variate computational-complexity theory, which offers a more nuanced approach to complexity analysis. It also enabled the development the model-checking algorithms, which are today used in industrial semiconductor design tools.