Practical Aspects of Declarative Languages: 20th International Symposium, PADL 2018, Los Angeles, CA, USA, January 8–9, 2018, Proceedings (Lecture Notes in Computer Science (10702))
معرفی کتاب «Practical Aspects of Declarative Languages: 20th International Symposium, PADL 2018, Los Angeles, CA, USA, January 8–9, 2018, Proceedings (Lecture Notes in Computer Science (10702))» نوشتهٔ Francesco Calimeri,Kevin Hamlen,Nicola Leone (eds.)، منتشرشده توسط نشر Springer International Publishing : Imprint : Springer در سال 1070. این کتاب در 4 صفحه، فرمت pdf، زبان انگلیسی ارائه شده است.
This book constitutes the proceedings of the 20th International Symposium on Practical Aspects of Declarative Languages, PADL 2018, held in Los Angeles, CA, USA, in January 2018 and collocated with the 45th ACM SIGPLAN Symposium on Principles of Programming Languages. The 13 regular papers presented in this volume together with the abstracts of 2 invited talks were carefully reviewed and selected from 23 submissions. They deal with functional programming; constraint programming and business rules; prolog and optimization; and answer set programming. Preface 6 Organization 8 Abstracts of Invited Talks 10 Declarative Algorithms on Big Data: A Logic-Based Solution 11 “Safe” Languages Require Sequential Consistency 12 Contents 13 Functional Programming 15 Probabilistic Functional Logic Programming 16 1 Introduction 16 2 The Basics 17 2.1 Modeling Distributions 18 2.2 Querying Distributions 20 3 The Details 22 3.1 Call-Time Choice vs. Run-Time Choice 22 3.2 Combination of Non-strictness and Non-determinism 24 3.3 Definition of the Bind Operator 26 3.4 Non-deterministic Events 28 4 Related and Future Work 29 5 Conclusion 30 References 31 Rewriting High-Level Spreadsheet Structures into Higher-Order Functional Programs 33 1 Introduction 33 2 From Cell Arrays to Higher-Order Functions 34 2.1 A Formal Spreadsheet Language 35 2.2 Example: DNA Sequence Alignment 35 2.3 Intuitive Rewriting of Cell Arrays 37 2.4 Different Kinds of Cell Arrays 38 3 Rewriting Cell Arrays 38 3.1 Cell Arrays and Transitive and Intransitive Cell References 39 3.2 Rewriting Semantics 39 3.3 Preemptive Cycle Detection 42 3.4 Correctness 42 4 Implementation 43 4.1 Parallelization Strategies 43 4.2 Handling Over-Generalization 43 5 Performance Evaluation 44 5.1 Spreadsheet Selection 45 5.2 Results 45 6 Alternative Usages and Related Work 46 7 Conclusion 47 References 48 SNÅRKL: Somewhat Practical, Pretty Much Declarative Verifiable Computing in Haskell 49 1 Introduction 49 2 SNÅRKL by Example 52 3 Compiling to R1CS 54 3.1 Elaboration 55 3.2 Products, Sums, Recursion 56 3.3 From TExps to R1CS 58 4 Constraint Minimization 61 5 Measurements 62 6 Related Work 63 7 Conclusion 64 References 64 Hygienic Source-Code Generation Using Functors 66 1 Introduction 66 2 Lexing Functor Generation 69 2.1 An Expanded Specification 71 3 Conclusion 72 References 73 Constraint Programming and Business Rules 74 Three Is a Crowd: SAT, SMT and CLP on a Chessboard 75 1 Motivation: Model-Based Constraint Solving 75 2 The Crowded Chessboard Problem and Its B Solution 76 2.1 B Solution 77 2.2 Specifying Movements 77 2.3 Specifying the Number of Pieces 78 2.4 Solving the Crowded Chessboard Puzzle 79 2.5 New CLP and SAT Integration 79 3 A Prolog CLP(FD) Solution 80 4 OscaR/Scala Solution 81 5 SAT Encoding 83 6 SMT Encoding 85 7 Related Work and Other Encodings 86 8 Empirical Evaluation 87 9 Conclusion, Outlook and Discussion 89 References 89 An Automated Detection of Inconsistencies in SBVR-based Business Rules Using Many-sorted Logic 92 1 Introduction 92 2 Motivation 94 2.1 Introduction to Many-sorted Logic 95 3 Proposed Approach 96 3.1 Pre-transformation Step 97 3.2 Transformation Step 100 3.3 Verification Step 102 4 Implementation 103 5 Experimental Studies and Discussions 105 References 107 Prolog and Optimizations 109 Exploiting Term Hiding to Reduce Run-Time Checking Overhead 110 1 Introduction 110 2 Preliminaries 112 3 An Abstract Approach to Modular Logic Programs 112 4 Run-Time Checking of Modular Programs 114 5 Shallow Run-Time Checking 116 6 Experimental Results 120 7 Related Work 123 8 Conclusions 124 References 125 On k-colored Lambda Terms and Their Skeletons 127 1 Introduction 127 2 A Bijection Between 2-colored Motzkin Trees and Binary Trees 128 3 Closed, Affine and Linear Terms 131 3.1 Closed Lambda Terms 132 3.2 Closed Affine Lambda Terms 132 3.3 Closed Linear Lambda Terms 134 4 k-colored Simply-Typed Closed Lambda Terms 134 4.1 Type Inference for k-colored Terms 135 5 Related Work 140 6 Conclusions 141 References 142 Answer Set Programming 143 Optimizing Answer Set Computation via Heuristic-Based Decomposition 144 1 Introduction 145 2 Answer Set Programming 146 3 A Heuristic-Guided Decomposition Algorithm 147 4 Integrating the SmartDecomposition Algorithm into a Real System: The DLV Case 150 4.1 The Estimate Function 150 4.2 The EstimateDecomposition Function 151 4.3 The ChooseBestDecomposition and Decomposition IsPreferable Functions 152 4.4 Fine-Tuning and Further Implementation Issues 154 5 Experimental Evaluation 155 5.1 Impact of I-DLVSD on ASP Solvers 158 6 Conclusion 158 References 159 LoIDE: A Web-Based IDE for Logic Programming Preliminary Report 161 1 Introduction 161 2 The LoIDE Project 162 3 Implementation 164 3.1 General Architecture 164 3.2 Back-End – The LoIDE Web-Server 166 3.3 Front-End – The LoIDE GUI 166 3.4 The EMBASP Server Executor 166 4 Related Works 167 5 Conclusion and Future Work 168 References 168 A REST-Based Development Framework for ASP: Tools and Application 170 1 Introduction 170 2 The DLVService REST Application 171 3 An Industry-Level Case of Study: Surveillance for Photovoltaic Systems 173 4 Setting up Services with ASPIDE 175 5 Conclusion 177 References 177 Navigating Online Semantic Resources for Entity Set Expansion 179 1 Introduction 179 2 Integrating Semantic Resources 181 2.1 Semantic Resources 181 2.2 Entity Networks 182 2.3 Entity Network Construction via ASP with External Predicates 184 3 Word Sense Disambiguation 186 3.1 Classical Approaches 186 3.2 Optimal Common Ancestors 187 3.3 Problem Definition and ASP-Based Sense Detector 188 4 Least Common Subsumers 189 5 Entity Set Expansion 190 5.1 Existing Approaches to ESE 190 5.2 ESE Using Entity Networks 191 5.3 Real-World Use Cases 192 6 Conclusion 193 References 193 Automatic Web Services Composition for Phylotastic 195 1 Introduction 195 2 Background 196 2.1 Phylotastic 196 2.2 The Web Service Composition Problem 198 3 Web Service Composition Framework for Phylotastic 198 3.1 Ontology and Ontology API 199 3.2 Web Service Registry 201 3.3 Workflow Configuration Module 201 3.4 Planning Engine 202 3.5 Execution Monitoring 208 4 Use Case 209 5 Discussion and Future Work 210 References 210 Author Index 212 Front Matter ....Pages I-XIV Front Matter ....Pages 1-1 Probabilistic Functional Logic Programming (Sandra Dylus, Jan Christiansen, Finn Teegen)....Pages 3-19 Rewriting High-Level Spreadsheet Structures into Higher-Order Functional Programs (Florian Biermann, Wensheng Dou, Peter Sestoft)....Pages 20-35 Snårkl: Somewhat Practical, Pretty Much Declarative Verifiable Computing in Haskell (Gordon Stewart, Samuel Merten, Logan Leland)....Pages 36-52 Hygienic Source-Code Generation Using Functors (Karl Crary)....Pages 53-60 Front Matter ....Pages 61-61 Three Is a Crowd: SAT, SMT and CLP on a Chessboard (Sebastian Krings, Michael Leuschel, Philipp Körner, Stefan Hallerstede, Miran Hasanagić)....Pages 63-79 An Automated Detection of Inconsistencies in SBVR-based Business Rules Using Many-sorted Logic (Kritika Anand, Pavan Kumar Chittimalli, Ravindra Naik)....Pages 80-96 Front Matter ....Pages 97-97 Exploiting Term Hiding to Reduce Run-Time Checking Overhead (Nataliia Stulova, José F. Morales, Manuel V. Hermenegildo)....Pages 99-115 On k-colored Lambda Terms and Their Skeletons (Paul Tarau)....Pages 116-131 Front Matter ....Pages 133-133 Optimizing Answer Set Computation via Heuristic-Based Decomposition (Francesco Calimeri, Davide Fuscà, Simona Perri, Jessica Zangari)....Pages 135-151 LoIDE: A Web-Based IDE for Logic Programming Preliminary Report (Stefano Germano, Francesco Calimeri, Eliana Palermiti)....Pages 152-160 A REST-Based Development Framework for ASP: Tools and Application (Gelsomina Catalano, Giovanni Laboccetta, Kristian Reale, Francesco Ricca, Pierfrancesco Veltri)....Pages 161-169 Navigating Online Semantic Resources for Entity Set Expansion (Weronika T. Adrian, Marco Manna)....Pages 170-185 Automatic Web Services Composition for Phylotastic (Thanh H. Nguyen, Tran Cao Son, Enrico Pontelli)....Pages 186-202 Back Matter ....Pages 203-203
دانلود کتاب Practical Aspects of Declarative Languages: 20th International Symposium, PADL 2018, Los Angeles, CA, USA, January 8–9, 2018, Proceedings (Lecture Notes in Computer Science (10702))