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 data base 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.

Topic 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 2022 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.

Free access to the proceedings is available from January 12 to February 10 using this link.

If you would like a print copy of the proceedings, please let us know by January 31 using this form.

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

Mon 17 Jan

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

09:00 - 10:00
Invited talkPADL at Directors
Chair(s): James Cheney University of Edinburgh; Alan Turing Institute

Remote session chair

09:00
60m
Keynote
People, Ideas, and the Path AheadIn-Person
PADL
Marcello Balduccini Saint Joseph's University, USA
10:20 - 12:00
Languages, Methods and ToolsPADL at Directors
Chair(s): Esra Erdem Sabanci University, Turkey

Remote session chair

10:20
25m
Talk
Smart Devices and Large Scale Reasoning via ASP: Tools and ApplicationsRemote
PADL
Kristian Reale Department of Mathematics and Computer Science University of Calabria - DLVSystem S.r.l., Francesco Calimeri University of Calabria, Nicola Leone University of Calabria, Italy, Francesco Ricca University of Calabria, Italy
10:45
25m
Talk
Timed Concurrent Language for Argumentation: an Interleaving ApproachRemote
PADL
Stefano Bistarelli University of Perugia, Maria Chiara Meo University “G. d’Annunzio” of Chieti-Pescara, Carlo Taticchi University of Perugia
11:10
25m
Talk
Towards Dynamic Consistency Checking in Goal-directed Predicate Answer Set ProgrammingRemote
PADL
Joaquín Arias Universidad Rey Juan Carlos, Manuel Carro IMDEA Software Institute and T.U. of Madrid (UPM), Gopal Gupta The University of Texas at Dallas
DOI Pre-print File Attached
11:35
25m
Talk
Implementing Stable-Unstable Semantics with ASPTOOLS and ClingoRemote
PADL
Tomi Janhunen Tampere University
13:30 - 14:45
Answer Set ProgrammingPADL at Directors
Chair(s): Martin Gebser University of Klagenfurt, Austria

Remote session chair

13:30
25m
Talk
Modelling the Outlier Detection Problem in QASPRemote
PADL
Pierpaolo Bellusci University of Calabria, Giuseppe Mazzotta University of Calabria, Fracesco Ricca University of Calabria
13:55
25m
Talk
Multi-Agent Pick and Delivery with Capacities: Action Planning vs Path FindingRemote
PADL
Nima Tajelipirbazari TED University, Çağrı Uluç Yıldırımoğlu Sabanci University, Orkunt Sabuncu TED University, Ali Can Arıcı Ekol Logistics, İdil Helin Özen Ekol Logistics, Volkan Patoğlu Sabanci University, Esra Erdem Sabanci University, Turkey
14:20
25m
Talk
Determining Action Reversibility in STRIPS Using Answer Set Programming with QuantifiersRemote
PADL
Wolfgang Faber University of Klagenfurt, Michael Morak University of Klagenfurt, Lukas Chrpa Czech Technical University in Prague

Tue 18 Jan

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

09:00 - 10:00
Invited talkPADL at Directors
Chair(s): Antonio Brogi Università di Pisa, Simona Perri University of Calabria, Italy

Remote session chair

09:00
60m
Keynote
Declarative Programming and EducationRemote
PADL
Shriram Krishnamurthi Brown University, United States
10:20 - 12:00
Declarative SolutionsPADL at Directors
Chair(s): Francesco Calimeri University of Calabria

Remote session chair

10:20
25m
Talk
Green Application Placement in the Cloud-IoT ContinuumRemote
PADL
Stefano Forti University of Pisa, Antonio Brogi Università di Pisa
10:45
25m
Talk
Decomposition-based job-shop scheduling with constrained clusteringRemote
PADL
Mohammed M. S. El-Kholany University of Klagenfurt, Martin Gebser University of Klagenfurt, Austria, Konstantin Schekotihin Alpen-Adria Universit�t Klagenfurt
11:10
25m
Talk
Modeling and Verification of Real-Time Systems with the Event Calculus and s(CASP)Remote
PADL
Sarat Chandra Varanasi The University of Texas at Dallas, Joaquín Arias Universidad Rey Juan Carlos, Elmer Salazar The University of Texas at Dallas, Fang Li The University of Texas at Dallas, Kinjal Basu The University of Texas at Dallas, Gopal Gupta The University of Texas at Dallas
11:35
25m
Talk
Parallel Declarative Solutions of Sequencing Problems using Multi-valued Decision Diagrams and GPUsRemote
PADL
Fabio Tardivo New Mexico State University, Enrico Pontelli
13:30 - 14:45
Functional and Logic ProgrammingPADL at Directors
Chair(s): Alan Jeffrey Roblox
13:30
25m
Talk
Graph-based Interpretation of Normal Logic ProgramsRemote
PADL
Fang Li The University of Texas at Dallas, Elmer Salazar The University of Texas at Dallas, Gopal Gupta The University of Texas at Dallas
13:55
25m
Talk
Functional Programming on Top of SQL EnginesRemote
PADL
Tobias Burghardt University of Tübingen, Denis Hirn University of Tübingen, Torsten Grust University of Tübingen
14:20
25m
Talk
CircuitFlow: : A Domain Specific Language for Dataflow ProgrammingIn-Person
PADL
Riley Evans University of Bristol, Samantha Frohlich University of Bristol, Meng Wang University of Bristol

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 for software engineering
  • Evaluation of implementation techniques on practical applications
  • Practical experiences and industrial applications
  • Novel uses of declarative languages in the classroom
  • Practical languages and extensions such as probabilistic and reactive languages

PADL 2022 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 2022 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 formatted according to the standard Springer LNCS style. The conference proceedings of PADL2022 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 about the place in which it has previously appeared.

Submissions are handled through the EasyChair conference management system:
https://easychair.org/conferences/?conf=padl2022.

Important dates

  • Abstract Deadline: 1st 6th October 2021 (AoE)
  • Deadline: 8th 13th October 2021 (AoE)
  • Notification: 5th November 2021
  • Symposium: 17-18th January 2022

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, in the journal Theory and Practice of Logic Programming (TPLP) https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming, and for papers related to functional programming, in Journal of Functional Programming (JFP) https://www.cambridge.org/core/journals/journal-of-functional-programming. The extended journal submissions should include roughly 30% more context including , for example, explanations for which there was no space, illuminating examples and proofs, additional definitions and theorems, further experimental results, implementation details and feedback from practical/engineering use, extended discussion of related work and such like.

Accepted Papers

Title
CircuitFlow: : A Domain Specific Language for Dataflow ProgrammingIn-Person
PADL
Decomposition-based job-shop scheduling with constrained clusteringRemote
PADL
Determining Action Reversibility in STRIPS Using Answer Set Programming with QuantifiersRemote
PADL
Functional Programming on Top of SQL EnginesRemote
PADL
Graph-based Interpretation of Normal Logic ProgramsRemote
PADL
Green Application Placement in the Cloud-IoT ContinuumRemote
PADL
Implementing Stable-Unstable Semantics with ASPTOOLS and ClingoRemote
PADL
Modeling and Verification of Real-Time Systems with the Event Calculus and s(CASP)Remote
PADL
Modelling the Outlier Detection Problem in QASPRemote
PADL
Multi-Agent Pick and Delivery with Capacities: Action Planning vs Path FindingRemote
PADL
Parallel Declarative Solutions of Sequencing Problems using Multi-valued Decision Diagrams and GPUsRemote
PADL
Smart Devices and Large Scale Reasoning via ASP: Tools and ApplicationsRemote
PADL
Timed Concurrent Language for Argumentation: an Interleaving ApproachRemote
PADL
Towards Dynamic Consistency Checking in Goal-directed Predicate Answer Set ProgrammingRemote
PADL
DOI Pre-print File Attached