Declarative languages comprise several well-established classes of formalisms, namely, functional, logic, and constraint programming. Such formalisms enjoy both sound theoretical bases and the availability of attractive frameworks for application development. Indeed, they have been already successfully applied to many different real-world situations, ranging from database management to active networks to software engineering to decision support systems.

New developments in theory and implementation fostered applications in new areas. At the same time, applications of declarative languages to novel and challenging problems raise many interesting research issues, including designing for scalability, language extensions for application deployment, and programming environments. Thus, applications drive the progress in the theory and implementation of declarative systems, and benefit from this progress as well.

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, database 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 2023 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.

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

Mon 16 Jan

Displayed time zone: Eastern Time (US & Canada) change

09:00 - 10:00
Opening & Invited TalkPADL at The Loft
Chair(s): Daniela Inclezan Miami University
09:00
60m
Talk
Towards Declarative Content Generation for Creativity Support Tools
PADL
Chris Martens Northeastern University
10:00 - 10:30
ReasoningPADL at The Loft
Chair(s): Anssi Yli-Jyrä Tampere University
10:00
30m
Talk
Using Hybrid Knowledge Bases for Meta-reasoning over OWL 2 QL
PADL
Haya Majid Qureshi Alpen-Adria-Universität Klagenfurt, Wolfgang Faber University of Klagenfurt
11:00 - 12:30
Domain Specific LanguagesPADL at The Loft
Chair(s): Sarat Chandra Varanasi The University of Texas at Dallas, General Electric Research
11:00
30m
Talk
Fluo: A Domain-Specific Language for Experiments in Fluorescence Microscopy (Application Paper)
PADL
Birthe van den Berg KU Leuven, Tom Schrijvers KU Leuven, Peter Dedecker KU Leuven
11:30
30m
Talk
SwitchLog: A Logic Programming Language for Network Switches
PADL
Vaibhav Mehta Princeton University, Devon Loehr Princeton University, John Sonchack University of Pennsylvania, USA, David Walker Princeton University
12:00
30m
Talk
Formalizing and Reasoning about Contracts between Agents
PADL
Dylan Flynn , Chasity Nadeau , Jeannine Shantz , Marcello Balduccini Saint Joseph's University, USA, Tran Cao Son New Mexico State University, Edward Griffor
14:00 - 15:30
Applications of Answer Set Programming (I)PADL at The Loft
Chair(s): Wolfgang Faber Alpen-Adria-Universität, Austria
14:00
30m
Talk
Jury-trial Story Construction and Analysis using Goal-directed Answer Set Programming
PADL
Zesheng Xu The University of Texas at Dallas, Gopal Gupta University of Texas at Dallas, USA, Elmer Salazar The University of Texas at Dallas, Joaquín Arias Universidad Rey Juan Carlos, Sarat Chandra Varanasi The University of Texas at Dallas, General Electric Research
14:30
30m
Talk
Solving Vehicle Equipment Specification Problems with Answer Set Programming
PADL
Raito Takeuchi Nagoya University, Mutsunori Banbara Nagoya University, Naoyuki Tamura Kobe University, JAPAN, Torsten Schaub University of Potsdam
15:00
30m
Talk
Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling
PADL
Anssi Yli-Jyrä Tampere University, Masood Feyzbakhsh Rankooh Tampere University, Tomi Janhunen Tampere University
16:00 - 17:30
Applications of Answer Set Programming (II)PADL at The Loft
Chair(s): Mutsunori Banbara Nagoya University
16:00
30m
Talk
Integrating ASP-based incremental reasoning in the videogame development workflow (Application Paper)
PADL
Denise Angilica Università Della Calabria, Giovambattista Ianni University of Calabria, Italy, Francesco Pacenza Department of Mathematics and Computer Science, University of Calabria, Jessica Zangari Università della Calabria
16:30
30m
Talk
UAV Compliance Checking using Answer Set Programming and Minimal Explanations towards Compliance (Application Paper)
PADL
Sarat Chandra Varanasi The University of Texas at Dallas, General Electric Research, Baoluo Meng GE Research, Christopher Alexander GE Research, Szabolcs Borgyos GE Research
17:00
30m
Talk
Flexible Job-shop Scheduling for Semiconductor Manufacturing with Hybrid Answer Set Programming (Application Paper)
PADL
Ramsha Ali University of Klagenfurt, Mohammed M. S. El-Kholany University of Klagenfurt, Martin Gebser University of Klagenfurt, Austria

Tue 17 Jan

Displayed time zone: Eastern Time (US & Canada) change

09:00 - 10:00
Invited TalkPADL at The Loft
Chair(s): Michael Hanus Kiel University
09:00
60m
Talk
Modern Macros
PADL
Robert Bruce Findler Northwestern University
10:00 - 10:30
DebuggingPADL at The Loft
Chair(s): Steven Libby University of Portland
10:00
30m
Talk
Automatic Rollback Suggestions for Incremental Datalog Evaluation
PADL
David Zhao The University of Sydney, Pavle Subotic Microsoft Azure, Mukund Raghothaman University of Southern California, Bernhard Scholz University of Sydney
11:00 - 12:30
Functional (Logic) ProgrammingPADL at The Loft
Chair(s): William E. Byrd University of Alabama at Birmingham, USA
11:00
30m
Talk
RICE: An Optimizing Curry Compiler
PADL
Steven Libby University of Portland
11:30
30m
Talk
Embedding Functional Logic Programming in Haskell via a Compiler Plugin
PADL
Kai-Oliver Prott University of Kiel, Germany, Finn Teegen University of Kiel, Germany, Jan Christiansen Flensburg University of Applied Sciences, Germany
DOI File Attached
12:00
30m
Talk
Program Synthesis Using Example Propagation
PADL
Niek Mulleners Utrecht University, Johan Jeuring Utrecht University, Bastiaan Heeren Open University of the Netherlands, Netherlands
14:00 - 15:30
VerificationPADL at The Loft
Chair(s): Linda Brodo Università di Sassari
14:00
30m
Talk
Execution Time Program Verification With Tight Bounds
PADL
Ana Carolina Silva FCUP, Manuel Barbosa HASLab - INESC TEC and FCUP, Mario Florido Universidade do Porto
14:30
30m
Talk
From Starvation Freedom to All-Path Reachability Problems in Constrained Rewriting
PADL
Misaki Kojima Nagoya University, Naoki Nishida Nagoya University
DOI File Attached
15:00
30m
Talk
Multiple Query Satisfiability of Constrained Horn Clauses
PADL
Emanuele De Angelis CNR-IASI, Fabio Fioravanti University of Chieti-Pescara, Alberto Pettorossi University of Rome Tor Vergata, Italy, Maurizio Proietti CNR-IASI
16:00 - 17:30
Analysis and Symbolic MethodsPADL at The Loft
Chair(s): Naoki Nishida Nagoya University
16:00
30m
Talk
Dynamic slicing of Reaction Systems based on assertions and monitors
PADL
Linda Brodo Università di Sassari, Roberto Bruni University of Pisa, Moreno Falaschi Dipartimento di Ingegneria dell'Informazione e Scienze Matematiche, University of Siena
16:30
30m
Talk
Linear Algebraic Abduction with Partial Evaluation
PADL
Tuan Nguyen National Institute of Informatics, Katsumi Inoue NII, Chiaki Sakama Wakayama University
DOI File Attached

Accepted Papers

Title
Automatic Rollback Suggestions for Incremental Datalog Evaluation
PADL
Dynamic slicing of Reaction Systems based on assertions and monitors
PADL
Embedding Functional Logic Programming in Haskell via a Compiler Plugin
PADL
DOI File Attached
Execution Time Program Verification With Tight Bounds
PADL
Flexible Job-shop Scheduling for Semiconductor Manufacturing with Hybrid Answer Set Programming (Application Paper)
PADL
Fluo: A Domain-Specific Language for Experiments in Fluorescence Microscopy (Application Paper)
PADL
Formalizing and Reasoning about Contracts between Agents
PADL
From Starvation Freedom to All-Path Reachability Problems in Constrained Rewriting
PADL
DOI File Attached
Integrating ASP-based incremental reasoning in the videogame development workflow (Application Paper)
PADL
Jury-trial Story Construction and Analysis using Goal-directed Answer Set Programming
PADL
Linear Algebraic Abduction with Partial Evaluation
PADL
DOI File Attached
Multiple Query Satisfiability of Constrained Horn Clauses
PADL
Program Synthesis Using Example Propagation
PADL
Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling
PADL
RICE: An Optimizing Curry Compiler
PADL
Solving Vehicle Equipment Specification Problems with Answer Set Programming
PADL
SwitchLog: A Logic Programming Language for Network Switches
PADL
UAV Compliance Checking using Answer Set Programming and Minimal Explanations towards Compliance (Application Paper)
PADL
Using Hybrid Knowledge Bases for Meta-reasoning over OWL 2 QL
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, database 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 2023 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 2023 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

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 2023 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://easychair.org/conferences/?conf=padl2023

Important Dates

Abstract submission: October 12, 2022 (AoE)

Paper submission: October 19, 2022 (AoE)

Notification: November 15, 2022

Camera-ready papers: December 1, 2022

Symposium: January 16-17, 2023

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.