POPL 2024
Sun 14 - Sat 20 January 2024 London, United Kingdom

PADL is a well-established forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative programming, including functional and logic programming, databases and constraint programming, and theorem proving.

PADL’24 will take place during 15-16 January 2024 as a physical (in-person) event. For each accepted paper at least one author is required to register for the conference and present the paper in person.

Registration

Unlike previous years, the registration for PADL’24 is handled separately from POPL. Please note that at least one author of each accepted paper must register specifically to PADL.

Click this link to register for PADL’24. The early registration deadline is December 14.

Proceedings

You can access PADL’24 proceedings for free for 4 weeks since the beginning of the symposium by following this link.

Highlights

Dates
Plenary
You're viewing the program in a time zone which is different from your device's time zone change time zone

Mon 15 Jan

Displayed time zone: London change

09:00 - 10:30
Types and EffectsPADL at Lovelace Room
Chair(s): Martin Gebser University of Klagenfurt, Austria
09:00
60m
Keynote
Modular Higher-Order Effects
PADL
K: Nicolas Wu Imperial College London
10:00
30m
Talk
Asynchronous Reactive Programming with Modal Types in Haskell
PADL
Patrick Bahr IT University of Copenhagen, Emil Houlborg IT University of Copenhagen, Gregers Thomas Skat Rørdam IT University of Copenhagen
Pre-print
10:30 - 11:00
10:30
30m
Coffee break
Break
Catering

11:00 - 12:30
Knowledge Representation and LearningPADL at Lovelace Room
Chair(s): Jessica Zangari Università della Calabria
11:00
30m
Talk
Explanation and Knowledge Acquisition in Ad Hoc Teamwork
PADL
Hasra Dodampegama University of Birmingham, Mohan Sridharan University of Birmingham
11:30
30m
Talk
Ontological Reasoning over Shy and Warded Datalog+/- for Streaming-based Architectures
PADL
Teodoro Baldazzi Università degli Studi Roma Tre, Luigi Bellomarini Banca d'Italia, Marco Favorito Banca d'Italia, Emanuel Sallinger TU Wien & University of Oxford
12:00
30m
Talk
FOLD-SE: An Efficient Rule-based Machine Learning Algorithm with Scalable Explainability
PADL
Huaduo Wang THE UNIVERSITY OF TEXAS AT DALLAS, Gopal Gupta University of Texas at Dallas
12:30 - 14:00
12:30
90m
Lunch
Lunch
Catering

14:00 - 15:30
Answer Set Programming IPADL at Lovelace Room
Chair(s): Gopal Gupta University of Texas at Dallas
14:00
30m
Talk
Marketplace Logistic via Answer Set Programming
PADL
Mario Alviano University of Calabria, Danilo Amendola Oliveru - Smartly Engineering, Luis Angel Rodriguez Reiners University of Calabria
14:30
30m
Talk
Rethinking Answer Set Programming Templates
PADL
Mario Alviano University of Calabria, Giovambattista Ianni University of Calabria, Italy, Francesco Pacenza Department of Mathematics and Computer Science, University of Calabria, Jessica Zangari Università della Calabria
15:00
30m
Talk
A direct ASP encoding for Declare
PADL
Francesco Chiariello University of Naples Federico II, Valeria Fionda University of Calabria, Antonio Ielo University of Calabria, Francesco Ricca University of Calabria, Italy
15:30 - 16:00
15:30
30m
Coffee break
Break
Catering

16:00 - 17:30
Panel DiscussionPADL at Lovelace Room
Chair(s): Ekaterina Komendantskaya Heriot-Watt University and Southampton University
16:00
90m
Panel
Declarative Languages for Safe AI
PADL
P: Gopal Gupta University of Texas at Dallas, P: Wen Kokke University of Edinburgh, P: Claudia Faggian Université de Paris & CNRS, P: Alessandro Bruni IT University of Copenhagen, P: Younesse Kaddar University of Oxford

Tue 16 Jan

Displayed time zone: London change

09:00 - 10:30
Declarative Programming for AIPADL at Lovelace Room
Chair(s): Martin Gebser University of Klagenfurt, Austria
09:00
60m
Keynote
Whats and Whys of Neural Network Verification (A Declarative Programming Perspective)
PADL
K: Ekaterina Komendantskaya Heriot-Watt University and Southampton University
10:00
30m
Talk
Using Logic Programming and Kernel-Grouping for Improving Interpretability of Convolutional Neural Networks
PADL
Parth Padalkar THE UNIVERSITY OF TEXAS AT DALLAS, Huaduo Wang THE UNIVERSITY OF TEXAS AT DALLAS, Gopal Gupta University of Texas at Dallas
10:30 - 11:00
10:30 - 11:00
10:30
30m
Coffee break
Break
Catering

12:30 - 14:00
12:30
90m
Lunch
Lunch
Catering

12:30 - 14:00
12:30
90m
Lunch
Lunch
Catering

14:00 - 15:30
Answer Set Programming IIPADL at Lovelace Room
Chair(s): Mario Alviano University of Calabria
14:00
30m
Talk
Automated Interactive Domain-Specific Conversational Agents that Understand Human Dialogs
PADL
Yankai Zeng The University of Texas at Dallas, Abhiramon Rajasekharan The University of Texas at Dallas, Parth Padalkar THE UNIVERSITY OF TEXAS AT DALLAS, Kinjal Basu IBM, Joaquín Arias Universidad Rey Juan Carlos, Gopal Gupta University of Texas at Dallas
14:30
30m
Talk
Forgetting Techniques for Optimizing ASP-based Stream Reasoning
PADL
Francesco Calimeri University of Calabria, Giovambattista Ianni University of Calabria, Italy, Francesco Pacenza Department of Mathematics and Computer Science, University of Calabria, Simona Perri University of Calabria, Italy, Jessica Zangari Università della Calabria
15:30 - 16:00
15:30
30m
Coffee break
Break
Catering

15:30 - 16:00
15:30
30m
Coffee break
Break
Catering

Accepted Papers

Title
A direct ASP encoding for Declare
PADL
Asynchronous Reactive Programming with Modal Types in Haskell
PADL
Pre-print
Automated Interactive Domain-Specific Conversational Agents that Understand Human Dialogs
PADL
Cutting the Cake Into Crumbs: Verifying Envy-Free Cake-Cutting Protocols using Bounded Integer Arithmetic
PADL
Explanation and Knowledge Acquisition in Ad Hoc Teamwork
PADL
FOLD-SE: An Efficient Rule-based Machine Learning Algorithm with Scalable Explainability
PADL
Forgetting Techniques for Optimizing ASP-based Stream Reasoning
PADL
Hardware implementation of OCaml using a synchronous functional language
PADL
Marketplace Logistic via Answer Set Programming
PADL
Ontological Reasoning over Shy and Warded Datalog+/- for Streaming-based Architectures
PADL
Rethinking Answer Set Programming Templates
PADL
Rhyme: A Data-Centric Expressive Query Language for Nested Data Structures
PADL
Using Logic Programming and Kernel-Grouping for Improving Interpretability of Convolutional Neural Networks
PADL

Call for Papers

PADL is a well-established forum for researchers and practitioners to present original work emphasizing novel applications and implementation techniques for all forms of declarative programming, including functional and logic programming, databases and constraint programming, and theorem proving.

Topics of interest include, but are not limited to:

  • Innovative applications of declarative languages
  • Declarative domain-specific languages and applications
  • Practical applications of theoretical results
  • New language developments and their impact on applications
  • Declarative languages and software engineering
  • Evaluation of implementation techniques on practical applications
  • Practical experiences and industrial applications
  • Novel uses of declarative languages in the classroom
  • Practical extensions such as constraint-based, probabilistic, and reactive languages

PADL 2024 especially welcomes new ideas and approaches related to applications, design and implementation of declarative languages going beyond the scope of the past PADL symposia, for example, advanced database languages and contract languages, as well as verification and theorem proving methods that rely on declarative languages.

Submissions

PADL 2024 welcomes three kinds of submission:

  • Technical papers (max. 15 pages): Technical papers must describe original, previously unpublished research results.

  • Application papers (max. 8 pages): Application papers are a mechanism to present important practical applications of declarative languages that occur in industry or in areas of research other than Computer Science. Application papers are expected to describe complex and/or real-world applications that rely on an innovative use of declarative languages. Application descriptions, engineering solutions and real-world experiences (both positive and negative) are solicited.

  • Extended abstracts (max. 3 pages): Describing new ideas, a new perspective on already published work, or work-in-progress that is not yet ready for a full publication. Extended abstracts will be posted on the symposium website but will not be published in the formal proceedings.

All page limits exclude references. Submissions must be written in English and formatted according to the standard Springer LNCS style, see https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines

The review process of PADL 2024 is double-anonymous. In your submission, please, omit your names and institutions; refer to your prior work in the third person, just as you refer to prior work by others; do not include acknowledgements that might identify you.

Additional material intended for reviewers but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them.

Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their reports. So, for LaTeX, we recommend that authors use:

\pagestyle{plain}
\usepackage{lineno}
\linenumbers 

The conference proceedings of PADL 2024 will be published by Springer-Verlag in the Lecture Notes in Computer Science series. Work that already appeared in unpublished or informally published workshops proceedings may be submitted but the authors should notify the program chairs where it has previously appeared.

Papers should be submitted electronically at https://padl2024.hotcrp.com

Distinguished Papers

The authors of a small number of distinguished papers will be invited to submit a longer version for journal publication after the symposium. For papers related to logic programming, that will be in the journal Theory and Practice of Logic Programming (TPLP), and for papers related to functional programming, in Journal of Functional Programming (JFP). The extended journal submissions should be substantially (roughly 30%) extended: explanations for which there was no space, illuminating examples and proofs, additional definitions and theorems, further experimental results, implementational details and feedback from practical/engineering use, extended discussion of related work, and so on. These submissions will then be subject to the usual peer review process by the journal, although with the aim of a swifter review process by reusing original reviews from PADL.