Practical Aspects of Declarative Languages: 24th International Symposium, PADL 2022, Philadelphia, PA, USA, January 17–18, 2022, Proceedings

Preface
Organization
Abstracts of Invited Talks
	People, Ideas, and the Path Ahead
	Declarative Programming and Education
	Contents
Invited Talk
People, Ideas, and the Path Ahead
	1 Introduction
	2 KR Methodology and Practical Applications
	3 Hybrid Declarative Languages for Practical Applications
	4 Intelligent Agents as Thought Partners
	5 Conclusion
	References
Answer Set Programming
Modelling the Outlier Detection Problem in ASP(Q)
	1 Introduction
	2 Preliminaries
	3 Outlier Detection
	4 ASP(Q) Encoding
	5 Experiments
	6 Conclusion
	References
Multi-agent Pick and Delivery with Capacities: Action Planning Vs Path Finding
	1 Introduction
	2 Related Work
	3 MAPDC-P: Solving MAPDC with a Planning Approach
		3.1 MAPDC as a Planning Problem
		3.2 Solving MAPDC-P Using Multi-shot ASP
	4 MAPDC-G: Solving MAPDC with a Path Finding Approach
		4.1 MAPDC as a Graph Problem
		4.2 Solving MAPDC-G Using Multi-shot ASP
	5 Experimental Evaluations
	6 Conclusions
	References
Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers
	1 Introduction
	2 Background
	3 Reversibility of Actions
	4 ASP(Q) Encodings of Reversibility
		4.1 the plasp Format
		4.2 a Uniform Reversibility Encoding Using ASP(Q)
		4.3 A Non-uniform Reversibility Encoding Using ASP(Q)
	5 Experiments
	6 Conclusions
	References
Functional Programming
Functional Programming on Top of SQL Engines
	1 Recursive SQL UDFs: From 1000s of Plans to One Plan
	2 Treating SQL UDFs Like Functions (Not Queries)
		2.1 Transition from SQL to FP
		2.2 From Recursion Towards Iteration: CPS and Defunctionalization
		2.3 Trampolined Style: Single Loop Replaces Mutual Recursion
	3 An Iterative SQL-Based Interpreter for Recursive UDFs
		3.1 Memoizing the Results of Recursive Calls
		3.2 Optimizations: Slimmer/Shorter Working and Union Tables
	4 Experiments: Functional Programming on Top of PostgreSQL
	5 More Related Work
	6 Wrap-Up
	References
CircuitFlow: A Domain Specific Language for Dataflow Programming
	1 Introduction
	2 CircuitFlow Language
		2.1 DataStores
		2.2 Circuit Type
		2.3 Circuit Constructors
		2.4 CircuitFlow in Action
		2.5 mapC Operator
	3 CircuitFlow Under the Hood
		3.1 Circuit API
		3.2 Network Typeclass
		3.3 The Basic Network Representation
		3.4 Translation to a BasicNetwork
	4 Benchmarks
	5 Discussion and Related Work
	6 Conclusion
	References
Languages, Methods and Tools
Timed Concurrent Language for Argumentation: An Interleaving Approach
	1 Introduction
	2 Background
	3 Syntax and Semantics
	4 Modelling a Dialogue
	5 tcla Simulator
	6 Related Work
	7 Conclusion
	References
Towards Dynamic Consistency Checking in Goal-Directed Predicate Answer Set Programming
	1 Introduction
	2 Background: S(CASP)
		2.1 Execution Procedure of s(CASP)
		2.2 Unsafe Variables and Uninterpreted Function Symbols
		2.3 s(CASP) as a Conservative Extension of ASP
		2.4 The s(CASP) Interpreter
	3 Dynamic Consistency Checking in s(CASP)
		3.1 Motivation
		3.2 Outline of the DCC Approach
		3.3 Implementation of DCC in s(CASP)
	4 Evaluation
	5 Conclusions
	References
Implementing Stable-Unstable Semantics with ASPTOOLS and Clingo
	1 Introduction
	2 Preliminaries
		2.1 Minimal and Stable Models
		2.2 Stable-Unstable Semantics
	3 Modularity
	4 Translating NLPs into SAT
	5 Saturation
	6 Capturing Stable-Unstable Semantics
	7 Implementation and Practical Modeling
		7.1 Practical Modeling
		7.2 Performance Analysis
	8 Discussion and Conclusion
	References
Smart Devices and Large Scale Reasoning via ASP: Tools and Applications
	1 Introduction
	2 The DLV-LS System
	3 A Use Case Application of DLV-LS
	4 Conclusion
	References
Declarative Solutions
Decomposition-Based Job-Shop Scheduling with Constrained Clustering
	1 Introduction
	2 Job-Shop Scheduling Problem
	3 Feature Extraction
	4 Constrained Clustering Algorithm
	5 Evaluation Results
	6 Related Work
	7 Conclusions
	References
Modeling and Verification of Real-Time Systems with the Event Calculus and s(CASP)
	1 Introduction
	2 Background
		2.1 Easy Approach to Requirement Syntax (EARS)
		2.2 Basic Event Calculus (BEC)
		2.3 Goal-Directed Answer Set Programming
	3 Modeling and Verifying Cyber Physical Systems in EC
		3.1 Train-Gate-Controller in EARS
		3.2 Train-Gate-Requirements in EC Using s(CASP)
	4 Checking Safety and Liveness of Train-Gate-Controller
		4.1 Safety and Liveness Queries
	5 Conclusion and Future Work
	References
Parallel Declarative Solutions of Sequencing Problems Using Multi-valued Decision Diagrams and GPUs
	1 Introduction
	2 Background
		2.1 Multi-valued Decision Diagrams
		2.2 Large Neighborhood Search
		2.3 GPGPU with CUDA
		2.4 Related Works
	3 Design and Implementation
		3.1 Overview
		3.2 LNS Parallelization
		3.3 Implementation Details
	4 Results and Analysis
		4.1 Results
		4.2 Analysis
	5 Conclusions and Future Work
	References
Green Application Placement in the Cloud-IoT Continuum
	1 Introduction
	2 GFogBrain in Action
	3 Related Work
	4 Concluding Remarks
	References
Author Index