- curry - lists.rwth-aachen.de

[CfP] ICLP 2022 - Call for Recently Published Research Papers
by Michael Hanus 09 Feb '22

09 Feb '22

Call for Recently Published Research Papers for ICLP 2022 Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming. Contributions are sought for the Recently Published Research Track for papers related to logic programming that appeared recently (from January 2020 onwards) in selective journals and conferences, but have not been previously presented at ICLP. Recently published research from all areas of logic programming are welcome, including but not restricted to: ** Foundations: Semantics, Formalisms, Nonmonotonic reasoning, Knowledge representation. ** Languages issues: Concurrency, Objects, Coordination, Mobility, Higher order, Types, Modes, Assertions, Modules, Meta-programming, Logic-based domain-specific languages, Programming techniques. ** Programming support: Program analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing, Execution visualization. ** Implementation: Compilation, Virtual machines, Memory management, Parallel/distributed execution, Constraint handling rules, Tabling, Foreign interfaces, User interfaces. ** Related Paradigms and Synergies: Inductive and coinductive logic programming, Constraint logic programming, Answer set programming, Interaction with SAT, SMT and CSP solvers, Theorem proving, Argumentation, Probabilistic programming, Machine learning. ** Applications: Databases, Big data, Data integration and federation, Software engineering, Natural language processing, Web and semantic web, Agents, Artificial intelligence, Computational life sciences, Cybersecurity, Robotics, Education. Important Dates *************** ** Extended abstract submission: March 12, 2022 ** Final notifications: April 30, 2022 ** Camera-ready copy due: May 16, 2022 ** Conference: July 31--August 8, 2022 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. Submission Details ****************** Expected submissions for the Recently Published Research Track: ** Extended abstract (2 or 3 pages in EPTCS format: http://style.eptcs.org/) describing previously published research (from January 2020 onwards) in selective journals and conferences, based on papers that have not been previously presented at ICLP. A title page should be appended to the submission with (i) details on the venue, where the original paper appeared, (ii) a link to the original paper, (iii) a paragraph describing why the authors believe this work warrants a presentation at ICLP. The extended abstracts will be published in the Technical Communication Proceedings. Submissions will be done via emailing both track chairs: * Martin Gebser: martin.gebser(a)aau.at * Tuncay Tekle: tuncay(a)cs.stonybrook.edu All accepted papers will be presented during the conference. Authors of accepted papers will, by default, be automatically included in the list of ALP members, who will receive quarterly updates from the Logic Programming Newsletter at no cost. All submissions must be written in English. Organization ************ ** General Chair Michael Codish, Ben-Gurion University of the Negev, Israel ** Program Chairs Yuliya Lierler, University of Nebraska Omaha, USA Jose F. Morales, IMDEA and Universidad Politécnica de Madrid, Spain ** Publicity Chair Victor Perez, IMDEA Software Institute, Spain ** Workshop Chair Daniela Inclezan, Miami University, USA ** Doctoral Consortium and Fall School Chairs Veronica Dahl, Simon Fraser University, Canada Carmine Dodaro, University of Calabria, Italy ** Programming Contest Chairs Mario Alviano, University of Calabria, Italy Vitaly Lagoon, Cadence Design Systems, USA Program Committee ***************** Salvador Abreu, Universidade de Évora, Portugal Mario Alviano, University of Calabria, Italy Marcello Balduccini, Saint Joseph's University, USA Mutsunori Banbara, Nagoya University, Japan Alex Brik, Google Inc., USA François Bry, Ludwig Maximilian University of Munich, Germany Pedro Cabalar,University of Corunna, Spain Francesco Calimeri, University of Calabria, Italy Manuel Carro, Technical University of Madrid and IMDEA, Spain Angelos Charalambidis, University of Athens, Greece Michael Codish, Ben-Gurion University of the Negev, Israel Stefania Costantini, University of L'Aquila, Italy Marc Denecker, KU Leuven, Belgium Marina De Vos, University of Bath, UK Agostino Dovier, University of Udine, Italy Inês Dutra, University of Porto, Portugal Thomas Eiter, Vienna University of Technology, Austria Esra Erdem, Sabanci University, Turkey Wolfgang Faber, Alpen-Adria-Universität Klagenfurt, Austria Jorge Fandinno, University of Nebraska Omaha, USA Paul Fodor, Stony Brook University, USA Andrea Formisano, University of Udine, Italy Gerhard Friedrich, Alpen-Adria-Universitaet Klagenfurt, Austria Sarah Alice Gaggl, Technische Universität Dresden, Germany Marco Gavanelli, University of Ferrara, Italy Martin Gebser, Alpen-Adria-Universität Klagenfurt, Austria Michael Gelfond, Texas Tech University, USA Laura Giordano, Università del Piemonte Orientale, Italy Gopal Gupta, University of Texas, USA Michael Hanus, CAU Kiel, Germany Manuel Hermenegildo, IMDEA and Universidad Politécnica de Madrid, Spain Giovambattista Ianni, University of Calabria, Italy Katsumi Inoue, National Institute of Informatics, Japan Tomi Janhunen, Tampere University, Finland Matti Järvisalo, University of Helsinkia, Finland Jianmin Ji, University of Science and Technology of China Nikos Katzouris, NCSR Demokritos Zeynep Kiziltan, University of Bologna, Italy Michael Kifer, Stony Brook University, USA Ekaterina Komendantskaya, Heriot-Watt University, UK Nicola Leone, University of Calabria, Italy Michael Leuschel, University of Dusseldorf, Germany Y. Annie Liu, Stony Brook University, USA Vladimir Lifschitz, University of Texas, USA Jorge Lobo, Pompeu Fabra University, Barcelona, Spain Marco Maratea, University of Genova, Italy Viviana Mascardi, University of Genova, Italy Alessandra Mileo, Dublin City University, INSIGHT Centre for Data Analytics, Ireland Manuel Ojeda-Aciego, University of Malaga, Spain Enrico Pontelli, New Mexico State University, USA Francesco Ricca, University of Calabria, Italy Orkunt Sabuncu, TED University, Turkey Chiaki Sakama, Wakayama University, Japan Vitor Santos Costa, University of Porto, Portugal Torsten Schaub, University of Potsdam, Germany Konstantin Schekotihin, Alpen-Adria-Universität Klagenfurt, Austria Tom Schrijvers, KU Leuven, Belgium Mohan Sridharan, University of Birmingham, UK Tran Cao Son, New Mexico State University, USA Theresa Swift, Universidade Nova de Lisboa, Portugal Paul Tarau, University of North Texas, USA Tuncay Tekle, Stony Brook University, USA Daniele Theseider Dupré, University of Piemonte Orientale, Italy Mirek Truszczynski, University of Kentucky, USA Joost Vennekens, KU Leuven, Belgium German Vidal, Universitat Politècnica de València, Spain Alicia Villanueva, VRAIN - Universitat Politècnica de València, Spain Antonius Weinzierl, Vienna University of Technology, Austria Kewen Wang, Griffith University Australia David Warren, SUNY Stony Brook, USA Jan Wielemaker, VU University of Amsterdam, Netherlands Stefan Woltran, Vienna University of Technology, Austria Roland Yap, National University of Singapore, Republic of Singapore Fangkai Yang, NVIDIA, USA Jia-Huai You, University of Alberta, Canada Yuanlin Zhang, Texas Tech University, US Zhizheng Zhang, Southeast University, China Neng-Fa Zhou, CUNY Brooklyn College and Graduate Center, USA

1 0

[Final CfP] ICLP 2022 - The 38th International Conference on Logic
by Michael Hanus 13 Jan '22

13 Jan '22

========================================================================= CALL FOR PAPERS ========================================================================= The 38th International Conference on Logic Programming (ICLP 2022) https://software.imdea.org/Conferences/ICLP2022/ Haifa, Israel August 2-8, 2022 ICLP 2022 will be a physical event in Haifa, Israel Part of the FLOC 2022 https://floc2022.org/ ========================================================================= Scope ***** Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming. Contributions are sought in all areas of logic programming, including but not restricted to: ** Foundations:Semantics, Formalisms, Nonmonotonic reasoning, Knowledge representation. ** Languages issues: Concurrency, Objects, Coordination, Mobility, Higher order, Types, Modes, Assertions, Modules, Meta-programming, Logic-based domain-specific languages, Programming techniques. ** Programming support: Program analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing, Execution visualization. ** Implementation: Compilation, Virtual machines, Memory management, Parallel/distributed execution, Constraint handling rules, Tabling, Foreign interfaces, User interfaces. ** Related Paradigms and Synergies: Inductive and coinductive logic programming, Constraint logic programming, Answer set programming, Interaction with SAT, SMT and CSP solvers, Theorem proving, Argumentation, Probabilistic programming, Machine learning. ** Applications: Databases, Big data, Data integration and federation, Software engineering, Natural language processing, Web and semantic web, Agents, Artificial intelligence, Computational life sciences, Cybersecurity, Robotics, Education. Tracks and Special Sessions *************************** Besides the main track, ICLP 2022 will host additional tracks: ** Applications Track: this track invites submissions of papers on emerging and deployed applications of LP, describing all aspects of the development, deployment, and evaluation of logic programming systems to solve real-world problems, including interesting case studies and benchmarks, and discussing lessons learned. ** Recently Published Research Track: this track provides a forum to discuss important results related to logic programming that appeared recently (from January 2020 onwards) in selective journals and conferences, but have not been previously presented at ICLP. In addition, ICLP 2022 will house: ** Doctoral Consortium and Mentoring Sessions: the Doctoral Consortium (DC) on Logic Programming provides students and early career researchers with the opportunity to present and discuss their research directions, obtain feedback from both peers and experts in the field, and participate in mentoring sessions on how to prepare and succeed for a research career. We will have leaders in logic programming research from academia and industry to give invited talks on their research areas. The best paper from the DC will be given the opportunity to make a presentation in a session of the main ICLP conference. ** Tutorials and Co-located Workshops. Important Dates *************** ** Abstract registration: January 14, 2022 ** Paper submission: January 21, 2022 ** Notification to authors (Regular papers): March 14, 2022 ** Revision submission (TPLP papers): April 1, 2022 ** Final notifications (all paper kinds): April 30, 2022 ** Camera-ready copy due (all paper kinds): May 16, 2022 ** Conference: July 31--August 8, 2022 Submission Details ****************** We note that papers accepted at ICLP may appear either in * Theory and Practice of Logic Programming Journal (TPLP), or * Technical Communication Proceeding (TC) published by Electronic Proceedings in Theoretical Computer Science (EPTCS) TPLP format is described at https://www.cambridge.org/core/journals/theory-and-practice-of-logic-progra… EPTCS format is described at http://style.eptcs.org/ All accepted papers will be presented during the conference. Authors of accepted papers will, by default, be automatically included in the list of ALP members, who will receive quarterly updates from the Logic Programming Newsletter at no cost. All submissions must be written in English. Expected submissions: * For Main Track and Application Track: All papers must describe original, previously unpublished research, and must not simultaneously be submitted for publication elsewhere. These restrictions do not apply to previously accepted workshop papers with a limited audience and/or without archival proceedings. ** Regular papers (14 pages in TPLP format, including references) The accepted regular papers will be published in TPLP. The program committee may recommend some regular papers to be published in Technical Communication Proceeding (TC). In this case, the papers will have to be reformatted into EPTCS format and not exceed 14 pages. Authors who submitted Regular papers that were accepted as TC may elect to convert their submissions into extended abstracts (2 or 3 pages in EPTCS format). This should allow authors to submit a long version elsewhere. ** Short papers (7 pages in EPTCS format, including references). The accepted short papers will be published in the Technical Communication Proceedings. * Recently Published Research Track ** Extended abstract (2 or 3 pages in EPTCS format) describing previously published research (from January 2020 onwards) in selective journals and conferences, but that have not been previously presented at ICLP. A title page should be appended to the submission with (i) details on the venue, where the original paper appeared, (ii) a link to the original paper, (iii) a paragraph describing why the authors believe this work warrants a presentation at ICLP. The extended abstracts will be published in the Technical Communication Proceedings. Submissions will be done via EasyChair. The submission Web page for ICLP2022 is https://easychair.org/my/conference?conf=iclp2022 Organization ************ ** General Chair Michael Codish, Ben-Gurion University of the Negev, Israel ** Program Chairs Yuliya Lierler, University of Nebraska Omaha, USA Jose F. Morales, IMDEA and Universidad Politécnica de Madrid, Spain ** Publicity Chair Victor Perez, IMDEA Software Institute, Spain ** Workshop Chair Daniela Inclezan, Miami University, USA ** Doctoral Consortium and Fall School Chairs Veronica Dahl, Simon Fraser University, Canada Carmine Dodaro, University of Calabria, Italy ** Programming Contest Chairs Mario Alviano, University of Calabria, Italy Vitaly Lagoon, Cadence Design Systems, USA ** 10-year/20-year Test-of-Time Award Chairs Esra Erdem, Sabanci University, Turkey Paul Tarau, Univeristy of North Texas, USA ** Recently Published Research Track Chairs Martin Gebser, Alpen-Adria-Universität Klagenfurt, Austria Tuncay Tekle, Stony Brook University, USA Program Committee ***************** * Salvador Abreu, Universidade de Évora, Portugal * Mario Alviano, University of Calabria, Italy * Marcello Balduccini, Saint Joseph's University, USA * Mutsunori Banbara, Nagoya University, Japan * Alex Brik, Google Inc., USA * François Bry, Ludwig Maximilian University of Munich, Germany * Pedro Cabalar,University of Corunna, Spain * Francesco Calimeri, University of Calabria, Italy * Manuel Carro, Technical University of Madrid and IMDEA, Spain * Angelos Charalambidis, University of Athens, Greece * Michael Codish, Ben-Gurion University of the Negev, Israel * Stefania Costantini, University of L'Aquila, Italy * Marc Denecker, KU Leuven, Belgium * Marina De Vos, University of Bath, UK * Agostino Dovier, University of Udine, Italy * Inês Dutra, University of Porto, Portugal * Thomas Eiter, Vienna University of Technology, Austria * Esra Erdem, Sabanci University, Turkey * Wolfgang Faber, Alpen-Adria-Universität Klagenfurt, Austria * Jorge Fandinno, University of Nebraska Omaha, USA * Paul Fodor, Stony Brook University, USA * Andrea Formisano, University of Udine, Italy * Gerhard Friedrich, Alpen-Adria-Universitaet Klagenfurt, Austria * Sarah Alice Gaggl, Technische Universität Dresden, Germany * Marco Gavanelli, University of Ferrara, Italy * Martin Gebser, Alpen-Adria-Universität Klagenfurt, Austria * Michael Gelfond, Texas Tech University, USA * Laura Giordano, Università del Piemonte Orientale, Italy * Gopal Gupta, University of Texas, USA * Michael Hanus, CAU Kiel, Germany * Manuel Hermenegildo, IMDEA and Universidad Politécnica de Madrid, Spain * Giovambattista Ianni, University of Calabria, Italy * Katsumi Inoue, National Institute of Informatics, Japan * Tomi Janhunen, Tampere University, Finland * Matti Järvisalo, University of Helsinkia, Finland * Jianmin Ji, University of Science and Technology of China * Nikos Katzouris, NCSR Demokritos * Zeynep Kiziltan, University of Bologna, Italy * Michael Kifer, Stony Brook University, USA * Ekaterina Komendantskaya, Heriot-Watt University, UK * Nicola Leone, University of Calabria, Italy * Michael Leuschel, University of Dusseldorf, Germany * Y. Annie Liu, Stony Brook University, USA * Vladimir Lifschitz, University of Texas, USA * Jorge Lobo, Pompeu Fabra University, Barcelona, Spain * Marco Maratea, University of Genova, Italy * Viviana Mascardi, University of Genova, Italy * Alessandra Mileo, Dublin City University, INSIGHT Centre for Data Analytics, Ireland * Manuel Ojeda-Aciego, University of Malaga, Spain * Enrico Pontelli, New Mexico State University, USA * Francesco Ricca, University of Calabria, Italy * Orkunt Sabuncu, TED University, Turkey * Chiaki Sakama, Wakayama University, Japan * Vitor Santos Costa, University of Porto, Portugal * Torsten Schaub, University of Potsdam, Germany * Konstantin Schekotihin, Alpen-Adria-Universität Klagenfurt, Austria * Tom Schrijvers, KU Leuven, Belgium * Mohan Sridharan, University of Birmingham, UK * Tran Cao Son, New Mexico State University, USA * Theresa Swift, Universidade Nova de Lisboa, Portugal * Paul Tarau, University of North Texas, USA * Tuncay Tekle, Stony Brook University, USA * Daniele Theseider Dupré, University of Piemonte Orientale, Italy * Mirek Truszczynski, University of Kentucky, USA * Joost Vennekens, KU Leuven, Belgium * German Vidal, Universitat Politècnica de València, Spain * Alicia Villanueva, VRAIN - Universitat Politècnica de València, Spain * Antonius Weinzierl, Vienna University of Technology, Austria * Kewen Wang, Griffith University Australia * David Warren, SUNY Stony Brook, USA * Jan Wielemaker, VU University of Amsterdam, Netherlands * Stefan Woltran, Vienna University of Technology, Austria * Roland Yap, National University of Singapore, Republic of Singapore * Fangkai Yang, NVIDIA, USA * Jia-Huai You, University of Alberta, Canada * Yuanlin Zhang, Texas Tech University, US * Zhizheng Zhang, Southeast University, China * Neng-Fa Zhou, CUNY Brooklyn College and Graduate Center, USA ========================================================================= Any additional question can be directed towards ICLP Chairs: iclp2022(a)easychair.org =========================================================================

1 0

2nd Call for Papers: FLOPS 2022
by Michael Hanus 17 Nov '21

17 Nov '21

* The deadline has been extended to December. * Best papers will be invited to an SCP special issue. ============================================================================ Call For Papers FLOPS 2022: 16th International Symposium on Functional and Logic Programming ============================================================================ In-Cooperation with ACM SIGPLAN May 10-12, 2022, Kyoto, Japan https://conf.researchr.org/home/flops-2022 Writing down detailed computational steps is not the only way of programming. The alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style include functional and logic programming, program transformation and re-writing, and extracting programs from proofs of their correctness. FLOPS aims to bring together practitioners, researchers and implementors of the declarative programming, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming. *** Scope *** FLOPS solicits original papers in all areas of declarative programming: * functional, logic, functional-logic programming, rewriting systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers, verifying properties of programs using declarative programming techniques; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems, etc.), applications and case studies. FLOPS promotes cross-fertilization among different styles of declarative programming. Therefore, research papers must be written to be understandable by the wide audience of declarative programmers and researchers. In particular, each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant for its area, and comparing it with previous work. Submission of system descriptions and declarative pearls are especially encouraged. *** Submission *** Submissions should fall into one of the following categories: * Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. * System descriptions: they should describe a working system and will be judged on originality, usefulness, and design. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy, as explained at http://www.sigplan.org/Resources/Policies/Republication. Submissions must be written in English and can be up to 15 pages excluding references, though system descriptions and pearls are typically shorter. The formatting has to conform to Springer's guidelines. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to an anonymized web page or an appendix, which does not count towards the page limit). However, it is the responsibility of the authors to guarantee that their paper can be understood and appreciated without referring to this supporting information; reviewers may simply choose not to look at it when writing their review. FLOPS 2022 will employ a double-blind reviewing process. To facilitate this, submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors' own related work should be in the third person (e.g., not "We build on our previous work..." but rather "We build on the work of..."). The purpose of this process is to help the reviewers come to a judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. Papers should be submitted electronically at https://easychair.org/conferences/?conf=flops2022 Springer Guidelines https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… *** Proceedings *** The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series (www.springer.com/lncs). Post-proceedings: The authors of 4-7 best papers will be invited to submit an extended version of their FLOPS paper to a special issue which will appear in the journal Science of Computer Programming (SCP). *** Important Dates *** Abstract submission: December 8, 2021 (AoE) Paper submission: December 12, 2021 (AoE) Notification: January 28, 2022 Camera ready due: February 20, 2022 Symposium: May 10-12, 2022 *** Program Comittee *** Andreas Abel Gothenburg University, Sweden Elvira Albert Universidad Complutense de Madrid Nada Amin Harvard Universuty, USA Davide Ancona Univ. Genova, Italy William Byrd University of Alabama, USA Matteo Cimini UMass Lowell, USA Youyou Cong Tokyo Institute of Technology, Japan Robert Gl��ck University of Copenhagen, Denmark Makoto Hamana Gunma University, Japan Michael Hanus Kiel University (co-chair) Zhenjiang Hu Peking University, China Atsushi Igarashi Kyoto University, Japan (co-chair) Ekaterina Komendantskaya Heriot-Watt University, UK Shin-Cheng Mu Academia Sinica, Taiwan Koko Muroya Kyoto University, Japan Klaus Ostermann University of Tuebingen, Germany Ricardo Rocha University of Porto, Portugal Tom Schrijvers KU Leuven, Belgium Harald Sondergaard University of Melbourne, Australia Hiroshi Unno University of Tsukuba, Japan Niki Vazou IMDEA, Spain Janis Voigtlaender University of Duisburg-Essen, Germany Nicolas Wu Imperial College, UK Ningning Xie University of Hong Kong, China Jeremy Yallop University of Cambridge, UK Neng-Fa Zhou City University of New York, USA *** Organizers *** Michael Hanus Kiel University, Germany (PC Co-Chair) Atsushi Igarashi Kyoto University, Japan (PC Co-Chair, General Chair) Keigo Imai Gifu University, Japan (Local Co-Chair) Taro Sekiyama National Institute of Informatics, Japan (Local Co-Chair) *** Contact Address *** flops2022 _AT_ easychair.org -------------------------------------------------------------------------------

1 0

ICLP 2022 Call For Papers
by Michael Hanus 21 Oct '21

21 Oct '21

========================================================================= CALL FOR PAPERS ========================================================================= The 38th International Conference on Logic Programming (ICLP 2022) Haifa, Israel August 2-8, 2022 ICLP 2022 will be a physical event in Haifa, Israel Part of the FLOC 2022 https://floc2022.org/ ========================================================================= Scope ***** Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming. Contributions are sought in all areas of logic programming, including but not restricted to: ** Foundations:Semantics, Formalisms, Nonmonotonic reasoning, Knowledge representation. ** Languages issues: Concurrency, Objects, Coordination, Mobility, Higher order, Types, Modes, Assertions, Modules, Meta-programming, Logic-based domain-specific languages, Programming techniques. ** Programming support: Program analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing, Execution visualization. ** Implementation: Compilation, Virtual machines, Memory management, Parallel/distributed execution, Constraint handling rules, Tabling, Foreign interfaces, User interfaces. ** Related Paradigms and Synergies: Inductive and coinductive logic programming, Constraint logic programming, Answer set programming, Interaction with SAT, SMT and CSP solvers, Theorem proving, Argumentation, Probabilistic programming, Machine learning. ** Applications: Databases, Big data, Data integration and federation, Software engineering, Natural language processing, Web and semantic web, Agents, Artificial intelligence, Computational life sciences, Cybersecurity, Robotics, Education. Tracks and Special Sessions *************************** Besides the main track, ICLP 2022 will host additional tracks: ** Applications Track: this track invites submissions of papers on emerging and deployed applications of LP, describing all aspects of the development, deployment, and evaluation of logic programming systems to solve real-world problems, including interesting case studies and benchmarks, and discussing lessons learned. ** Recently Published Research Track: this track provides a forum to discuss important results related to logic programming that appeared recently (from January 2020 onwards) in selective journals and conferences, but have not been previously presented at ICLP. In addition, ICLP 2022 will house: ** Doctoral Consortium and Mentoring Sessions: the Doctoral Consortium (DC) on Logic Programming provides students and early career researchers with the opportunity to present and discuss their research directions, obtain feedback from both peers and experts in the field, and participate in mentoring sessions on how to prepare and succeed for a research career. We will have leaders in logic programming research from academia and industry to give invited talks on their research areas. The best paper from the DC will be given the opportunity to make a presentation in a session of the main ICLP conference. ** Tutorials and Co-located Workshops. Important Dates *************** ** Abstract registration: January 14, 2022 ** Paper submission: January 21, 2022 ** Notification to authors (Regular papers): March 14, 2022 ** Revision submission (TPLP papers): April 1, 2022 ** Final notifications (all paper kinds): April 30, 2022 ** Camera-ready copy due (all paper kinds): May 16, 2022 ** Conference: July 31--August 8, 2022 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. Submission Details ****************** We note that papers accepted at ICLP may appear either in * Theory and Practice of Logic Programming Journal (TPLP), or * Technical Communication Proceeding (TC) published by Electronic Proceedings in Theoretical Computer Science (EPTCS) TPLP format is described at https://www.cambridge.org/core/journals/theory-and-practice-of-logic-progra… EPTCS format is described at http://style.eptcs.org/ All accepted papers will be presented during the conference. Authors of accepted papers will, by default, be automatically included in the list of ALP members, who will receive quarterly updates from the Logic Programming Newsletter at no cost. All submissions must be written in English. Expected submissions: * For Main Track and Application Track: All papers must describe original, previously unpublished research, and must not simultaneously be submitted for publication elsewhere. These restrictions do not apply to previously accepted workshop papers with a limited audience and/or without archival proceedings. ** Regular papers (14 pages in TPLP format, including references) The accepted regular papers will be published in TPLP. The program committee may recommend some regular papers to be published in Technical Communication Proceeding (TC). In this case, the papers will have to be reformatted into EPTCS format and not exceed 14 pages. Authors who submitted Regular papers that were accepted as TC may elect to convert their submissions into extended abstracts (2 or 3 pages in EPTCS format). This should allow authors to submit a long version elsewhere. ** Short papers (7 pages in EPTCS format, including references). The accepted short papers will be published in the Technical Communication Proceedings. * Recently Published Research Track ** Extended abstract (2 or 3 pages in EPTCS format) describing previously published research (from January 2020 onwards) in selective journals and conferences, but that have not been previously presented at ICLP. A title page should be appended to the submission with (i) details on the venue, where the original paper appeared, (ii) a link to the original paper, (iii) a paragraph describing why the authors believe this work warrants a presentation at ICLP. The extended abstracts will be published in the Technical Communication Proceedings. Submissions will be done via EasyChair. The submission Web page for ICLP2022 is https://easychair.org/my/conference?conf=iclp2022 Organization ************ ** General Chair Michael Codish, Ben-Gurion University of the Negev, Israel ** Program Chairs Yuliya Lierler, University of Nebraska Omaha, USA Jose F. Morales, IMDEA and Universidad Politécnica de Madrid, Spain ** Publicity Chair Victor Perez, IMDEA Software Institute, Spain ** Workshop Chair Daniela Inclezan, Miami University, USA ** Doctoral Consortium and Fall School Chairs Veronica Dahl, Simon Fraser University, Canada Carmine Dodaro, University of Calabria, Italy ** Programming Contest Chairs Mario Alviano, University of Calabria, Italy Vitaly Lagoon, Cadence Design Systems, USA Program Committee ***************** Salvador Abreu, Universidade de Évora, Portugal Mario Alviano, University of Calabria, Italy Marcello Balduccini, Saint Joseph's University, USA Mutsunori Banbara, Nagoya University, Japan Alex Brik, Google Inc., USA François Bry, Ludwig Maximilian University of Munich, Germany Pedro Cabalar,University of Corunna, Spain Francesco Calimeri, University of Calabria, Italy Manuel Carro, Technical University of Madrid and IMDEA, Spain Angelos Charalambidis, University of Athens, Greece Michael Codish, Ben-Gurion University of the Negev, Israel Stefania Costantini, University of L'Aquila, Italy Marc Denecker, KU Leuven, Belgium Marina De Vos, University of Bath, UK Agostino Dovier, University of Udine, Italy Inês Dutra, University of Porto, Portugal Thomas Eiter, Vienna University of Technology, Austria Esra Erdem, Sabanci University, Turkey Wolfgang Faber, Alpen-Adria-Universität Klagenfurt, Austria Jorge Fandinno, University of Nebraska Omaha, USA Paul Fodor, Stony Brook University, USA Andrea Formisano, University of Udine, Italy Gerhard Friedrich, Alpen-Adria-Universitaet Klagenfurt, Austria Sarah Alice Gaggl, Technische Universität Dresden, Germany Marco Gavanelli, University of Ferrara, Italy Martin Gebser, Alpen-Adria-Universität Klagenfurt, Austria Michael Gelfond, Texas Tech University, USA Laura Giordano, Università del Piemonte Orientale, Italy Gopal Gupta, University of Texas, USA Michael Hanus, CAU Kiel, Germany Manuel Hermenegildo, IMDEA and Universidad Politécnica de Madrid, Spain Giovambattista Ianni, University of Calabria, Italy Katsumi Inoue, National Institute of Informatics, Japan Tomi Janhunen, Tampere University, Finland Matti Järvisalo, University of Helsinkia, Finland Jianmin Ji, University of Science and Technology of China Nikos Katzouris, NCSR Demokritos Zeynep Kiziltan, University of Bologna, Italy Michael Kifer, Stony Brook University, USA Ekaterina Komendantskaya, Heriot-Watt University, UK Nicola Leone, University of Calabria, Italy Michael Leuschel, University of Dusseldorf, Germany Y. Annie Liu, Stony Brook University, USA Vladimir Lifschitz, University of Texas, USA Jorge Lobo, Pompeu Fabra University, Barcelona, Spain Marco Maratea, University of Genova, Italy Viviana Mascardi, University of Genova, Italy Alessandra Mileo, Dublin City University, INSIGHT Centre for Data Analytics, Ireland Manuel Ojeda-Aciego, University of Malaga, Spain Enrico Pontelli, New Mexico State University, USA Francesco Ricca, University of Calabria, Italy Orkunt Sabuncu, TED University, Turkey Chiaki Sakama, Wakayama University, Japan Vitor Santos Costa, University of Porto, Portugal Torsten Schaub, University of Potsdam, Germany Konstantin Schekotihin, Alpen-Adria-Universität Klagenfurt, Austria Tom Schrijvers, KU Leuven, Belgium Mohan Sridharan, University of Birmingham, UK Tran Cao Son, New Mexico State University, USA Theresa Swift, Universidade Nova de Lisboa, Portugal Paul Tarau, University of North Texas, USA Tuncay Tekle, Stony Brook University, USA Daniele Theseider Dupré, University of Piemonte Orientale, Italy Mirek Truszczynski, University of Kentucky, USA Joost Vennekens, KU Leuven, Belgium German Vidal, Universitat Politècnica de València, Spain Alicia Villanueva, VRAIN - Universitat Politècnica de València, Spain Antonius Weinzierl, Vienna University of Technology, Austria Kewen Wang, Griffith University Australia David Warren, SUNY Stony Brook, USA Jan Wielemaker, VU University of Amsterdam, Netherlands Stefan Woltran, Vienna University of Technology, Austria Roland Yap, National University of Singapore, Republic of Singapore Fangkai Yang, NVIDIA, USA Jia-Huai You, University of Alberta, Canada Yuanlin Zhang, Texas Tech University, US Zhizheng Zhang, Southeast University, China Neng-Fa Zhou, CUNY Brooklyn College and Graduate Center, USA ========================================================================= Any additional question can be directed towards ICLP Chairs: iclp2022(a)easychair.org =========================================================================

1 0

Call for Papers: FLOPS 2022
by Michael Hanus 26 Sep '21

26 Sep '21

============================================================================ Call For Papers FLOPS 2022: 16th International Symposium on Functional and Logic Programming ============================================================================ In-Cooperation with ACM SIGPLAN May 10-12, 2022, Kyoto, Japan https://conf.researchr.org/home/flops-2022 Writing down detailed computational steps is not the only way of programming. The alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style include functional and logic programming, program transformation and re-writing, and extracting programs from proofs of their correctness. FLOPS aims to bring together practitioners, researchers and implementors of the declarative programming, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming. *** Scope *** FLOPS solicits original papers in all areas of declarative programming: * functional, logic, functional-logic programming, rewriting systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers, verifying properties of programs using declarative programming techniques; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems, etc.), applications and case studies. FLOPS promotes cross-fertilization among different styles of declarative programming. Therefore, research papers must be written to be understandable by the wide audience of declarative programmers and researchers. In particular, each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant for its area, and comparing it with previous work. Submission of system descriptions and declarative pearls are especially encouraged. *** Submission *** Submissions should fall into one of the following categories: * Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. * System descriptions: they should describe a working system and will be judged on originality, usefulness, and design. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy, as explained at http://www.sigplan.org/Resources/Policies/Republication. Submissions must be written in English and can be up to 15 pages excluding references, though system descriptions and pearls are typically shorter. The formatting has to conform to Springer's guidelines. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to an anonymized web page or an appendix, which does not count towards the page limit). However, it is the responsibility of the authors to guarantee that their paper can be understood and appreciated without referring to this supporting information; reviewers may simply choose not to look at it when writing their review. FLOPS 2022 will employ a double-blind reviewing process. To facilitate this, submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors' own related work should be in the third person (e.g., not "We build on our previous work..." but rather "We build on the work of..."). The purpose of this process is to help the reviewers come to a judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. Papers should be submitted electronically at https://easychair.org/conferences/?conf=flops2022 Springer Guidelines https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… *** Proceedings *** The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series (www.springer.com/lncs). *** Important Dates *** Abstract submission: November 14, 2021 (AoE) Paper submission: November 21, 2021 (AoE) Notification: January 17, 2022 Camera ready due: February 17, 2022 Symposium: May 10-12, 2022 *** Program Comittee *** Andreas Abel Gothenburg University, Sweden Elvira Albert Universidad Complutense de Madrid Nada Amin Harvard Universuty, USA Davide Ancona Univ. Genova, Italy William Byrd University of Alabama, USA Matteo Cimini UMass Lowell, USA Youyou Cong Tokyo Institute of Technology, Japan Robert Gl��ck University of Copenhagen, Denmark Makoto Hamana Gunma University, Japan Michael Hanus Kiel University (co-chair) Zhenjiang Hu Peking University, China Atsushi Igarashi Kyoto University, Japan (co-chair) Ekaterina Komendantskaya Heriot-Watt University, UK Shin-Cheng Mu Academia Sinica, Taiwan Koko Muroya Kyoto University, Japan Klaus Ostermann University of Tuebingen, Germany Ricardo Rocha University of Porto, Portugal Tom Schrijvers KU Leuven, Belgium Harald Sondergaard University of Melbourne, Australia Hiroshi Unno University of Tsukuba, Japan Niki Vazou IMDEA, Spain Janis Voigtlaender University of Duisburg-Essen, Germany Nicolas Wu Imperial College, UK Ningning Xie University of Hong Kong, China Jeremy Yallop University of Cambridge, UK Neng-Fa Zhou City University of New York, USA *** Organizers *** Michael Hanus Kiel University, Germany (PC Co-Chair) Atsushi Igarashi Kyoto University, Japan (PC Co-Chair, General Chair) Keigo Imai Gifu University, Japan (Local Co-Chair) Taro Sekiyama National Institute of Informatics, Japan (Local Co-Chair) *** Contact Address *** flops2022 _AT_ easychair.org -------------------------------------------------------------------------------

1 0

Preliminary Call for Papers: FLOPS 2022
by Michael Hanus 06 Aug '21

06 Aug '21

Preliminary Call For Papers FLOPS 2022: 16th International Symposium on Functional and Logic Programming ============================================================================ May 10-12, 2022, Kyoto, Japan https://conf.researchr.org/home/flops-2022 Writing down detailed computational steps is not the only way of programming. The alternative, being used increasingly in practice, is to start by writing down the desired properties of the result. The computational steps are then (semi-)automatically derived from these higher-level specifications. Examples of this declarative style include functional and logic programming, program transformation and re-writing, and extracting programs from proofs of their correctness. FLOPS aims to bring together practitioners, researchers and implementors of the declarative programming, to discuss mutually interesting results and common problems: theoretical advances, their implementations in language systems and tools, and applications of these systems in practice. The scope includes all aspects of the design, semantics, theory, applications, implementations, and teaching of declarative programming. FLOPS specifically aims to promote cross-fertilization between theory and practice and among different styles of declarative programming. *** Scope *** FLOPS solicits original papers in all areas of declarative programming: * functional, logic, functional-logic programming, rewriting systems, formal methods and model checking, program transformations and program refinements, developing programs with the help of theorem provers or SAT/SMT solvers, verifying properties of programs using declarative programming techniques; * foundations, language design, implementation issues (compilation techniques, memory management, run-time systems, etc.), applications and case studies. FLOPS promotes cross-fertilization among different styles of declarative programming. Therefore, research papers must be written to be understandable by the wide audience of declarative programmers and researchers. In particular, each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant for its area, and comparing it with previous work. Submission of system descriptions and declarative pearls are especially encouraged. *** Submission *** Submissions should fall into one of the following categories: * Regular research papers: they should describe new results and will be judged on originality, correctness, and significance. * System descriptions: they should describe a working system and will be judged on originality, usefulness, and design. * Declarative pearls: new and excellent declarative programs or theories with illustrative applications. System descriptions and declarative pearls must be explicitly marked as such in the title. Submissions must be unpublished and not submitted for publication elsewhere. Work that already appeared in unpublished or informally published workshops proceedings may be submitted. See also ACM SIGPLAN Republication Policy, as explained at http://www.sigplan.org/Resources/Policies/Republication. Submissions must be written in English and can be up to 15 pages excluding references, though system descriptions and pearls are typically shorter. The formatting has to conform to Springer's guidelines. Regular research papers should be supported by proofs and/or experimental results. In case of lack of space, this supporting information should be made accessible otherwise (e.g., a link to an anonymized web page or an appendix, which does not count towards the page limit). However, it is the responsibility of the authors to guarantee that their paper can be understood and appreciated without referring to this supporting information; reviewers may simply choose not to look at it when writing their review. FLOPS 2022 will employ a double-blind reviewing process. To facilitate this, submitted papers must adhere to two rules: 1. author names and institutions must be omitted, and 2. references to authors' own related work should be in the third person (e.g., not "We build on our previous work..." but rather "We build on the work of..."). The purpose of this process is to help the reviewers come to a judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas. Papers should be submitted electronically at https://easychair.org/conferences/?conf=flops2022 Springer Guidelines https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… *** Proceedings *** The proceedings will be published by Springer International Publishing in the Lecture Notes in Computer Science (LNCS) series (www.springer.com/lncs). *** Important Dates *** Abstract submission: November 14, 2021 (AoE) Paper submission: November 21, 2021 (AoE) Notification: January 17, 2022 Camera ready due: February 17, 2022 Symposium: May 10-12, 2022 *** Program Comittee (to be completed) *** Andreas Abel Gothenburg University, Sweden Elvira Albert Universidad Complutense de Madrid Nada Amin Harvard Universuty, USA Davide Ancona Univ. Genova, Italy William Byrd University of Alabama, USA Matteo Cimini UMass Lowell, USA Youyou Cong Tokyo Institute of Technology, Japan Robert GlÃ¼ck University of Copenhagen, Denmark Makoto Hamana Gunma University, Japan Michael Hanus Kiel University (co-chair) Zhenjiang Hu Peking University, China Atsushi Igarashi Kyoto University, Japan (co-chair) Shin-Cheng Mu Academia Sinica, Taiwan Koko Muroya Kyoto University, Japan Ricardo Rocha University of Porto, Portugal Tom Schrijvers KU Leuven, Belgium Hiroshi Unno University of Tsukuba, Japan Niki Vazou IMDEA, Spain Janis Voigtlaender University of Duisburg-Essen, Germany Nicolas Wu Imperial College, UK Ningning Xie University of Hong Kong, China Jeremy Yallop University of Cambridge, UK Neng-Fa Zhou City University of New York, USA *** Organizers *** Michael Hanus Kiel University, Germany (PC Co-Chair) Atsushi Igarashi Kyoto University, Japan (PC Co-Chair, General Chair) Keigo Imai Gifu University, Japan (Local Co-Chair) Taro Sekiyama National Institute of Informatics, Japan (Local Co-Chair) *** Contact Address *** flops2022 _AT_ easychair.org -------------------------------------------------------------------------------

1 0

Recursion in Set Functions
by Andy Jost 06 Jul '21

06 Jul '21

Hi, I have run into an unexpected (to me) behavior when using set functions. I want to write a function that calculates a "penalty" that equals the number of times any character repeats three times in a string. For example, "aaaa" has penalty two, while "aabaa" has penalty zero. I thought it might be fun to use a functional pattern, so I wrote the following: penalty1 (b++[x,x,x]++e) = 1 + penalty1 (b++[x,x]++e) penalty1'default _ = 0 Although this works, it scales as the factorial of the longest substring of repeated characters. I thought I could improve it by introducing a set function and then using selectValue to cut down the search space. My idea was to recursively remove one character from an arbitrary triple, repeating until there are no more triples and counting the iterations. Rather than choosing every way to remove a character, I just want to choose one of them. I tried coding this several ways (below), but each time the result is "no value found." I am using PAKCS 3.3.0. Is this the expected behavior? Does it suggest a problem with the implementation of set functions or with my understanding of them? Can anyone point towards a solution using functional patterns? Other methods -- e.g., a pure-Haskell solution -- are trivial, so there's no need to point them out. Thanks, -Andy penalty2 pw = selectValue $ (set1 aux) pw where aux (b++[x,x,x]++e) = 1 + penalty2 (b++[x,x]++e) aux'default _ = 0 penalty3 pw = selectValue $ (set1 aux) pw where aux (b++[x,x,x]++e) = 1 + aux (b++[x,x]++e) aux'default _ = 0 penalty4 pw = let pw' = next pw in if pw' == [] then 0 else 1 + penalty4 pw' where next pw' = selectValue $ (set1 aux) pw' aux (b++[x,x,x]++e) = b++[x,x]++e aux'default _ = []

2 4

LOPSTR 2021 - First CfP
by Michael Hanus 19 Apr '21

19 Apr '21

------------------------------ 31st International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2021 http://saks.iasi.cnr.it/lopstr21/ Tallinn, Estonia, September 7-9, 2021 (co-located with PPDP 2021) === The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 31st International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2021) will be held at the Teachers' House in Tallinn, Estonia. Previous symposia were held in Bologna (as a virtual meeting), Porto, Frankfurt am Main, Namur, Edinburgh, Siena, Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Kongens Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, and Manchester. LOPSTR 2021 will be co-located with PPDP 2021 (International Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large, including, but not limited to: - synthesis - transformation - specialization - composition - optimization - inversion - specification - analysis and verification - testing and certification - program and model manipulation - machine learning for program development - verification and testing of machine learning systems - transformational techniques in SE - applications and tools Both full papers and extended abstracts describing foundations and applications in these areas are welcome. Survey papers that present some aspects of the above topics from a new perspective and papers that describe experience with industrial applications are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chairs in case of questions). * Important Dates * Abstract submission (optional): May 1, 2021 (AoE) Paper/Extended abstract submission: May 15, 2021 Notification: July 1, 2021 Camera-ready (for electronic pre-proceedings): August 20, 2021 Symposium: September 7-9, 2021 Revised paper submission: November 1, 2021 (AoE) Notification: December 1, 2021 Final version (for post-proceedings): January 16, 2022 * Submission Guidelines * Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in LNCS style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their report. Full papers cannot exceed 15 pages excluding references. Extended abstracts cannot exceed 8 pages excluding references. Additional pages may be used for appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them. Papers should be submitted via EasyChair: https://easychair.org/conferences/?conf=lopstr2021 * Proceedings * The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series as in previous years. Full papers can be directly accepted for publication in the formal proceedings, or accepted only for presentation at the symposium and inclusion in informal proceedings. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Authors should consult Springer's authors' guidelines and use their proceedings templates for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. * Best paper awards * Thanks to Springer's sponsorship, two awards (including a 500 EUR prize each) will be given at LOPSTR 2021. The program committee will select the winning papers based on relevance, originality and technical quality but may also take authorship into account (e.g. a student paper). * Program Committee * Roberto Amadini, University of Bologna, Italy Sabine Broda, University of Porto, Portugal Maximiliano Cristiá, CIFASIS-UNR, Argentina Włodzimierz Drabent, IPI PAN, Poland & Linköping University, Sweden Catherine Dubois, ENSIIE-Samovar, France Gregory Duck, National University of Singapore, Singapore Fabio Fioravanti, University of Chieti-Pescara, Italy Jeremy Gibbons, University of Oxford, UK Gopal Gupta, University of Texas at Dallas, USA Geoff Hamilton, Dublin City University, Ireland Michael Hanus, Kiel University, Germany Bishoksan Kafle, IMDEA Software Institute, Spain Maja Kirkeby, Roskilde University, Denmark Temur Kutsia, RISC J. Kepler University of Linz, Austria Michael Leuschel, University of Düsseldorf, Germany Pedro López-García, IMDEA Software Institute & CSIC, Spain Jacopo Mauro, University of Southern Denmark, Denmark Fred Mesnard, Université de la Réunion, France Alberto Momigliano, University of Milano, Italy Jorge A. Navas, SRI International, USA Naoki Nishida, Nagoya University, Japan Alicia Villanueva, Universitat Politècnica de València, Spain * Program Chairs * Emanuele De Angelis, IASI-CNR, Italy Wim Vanhoof, University of Namur, Belgium * Local organisation * Niccolò Veltri, Tallinn University of Technology, Estonia * Contact * For more information, please contact the Program Committee Chairs: emanuele.deangelis(a)iasi.cnr.it, wim.vanhoof(a)unamur.be

1 0

PAKCS 3.3.0 release available
by Michael Hanus 09 Feb '21

09 Feb '21

Dear Colleagues, I am pleased to announce a new stable release of PAKCS, see https://www.informatik.uni-kiel.de/~pakcs/download.html It is a new major release (also part of upcoming Debian und Ubuntu releases) with many small improvements but two bigger changes: 1. A new structure of the standard base libraries: Their structure is more closely with Haskell (e.g., `List` is renamed to `Data.List`) and some specialized libraries (Directory, FilePath, Time,...) have been moved into separate packages. See the release notes or the detailed migration guide at https://git.ps.informatik.uni-kiel.de/curry/curry-libs/-/blob/master/Migrat… 2. Addition of class `Data` with operations `===` (equality) and `aValue` (non-deterministic value generator). This class solves some open problems w.r.t. logic programming. The motivation for this class and its advantages are described in a [DECLARE/WFLP'19 paper](https://doi.org/10.1007/978-3-030-46714-2_15). A short discussion is also added below. Most of the existing Curry packages have been made compatible with this release, see https://www-ps.informatik.uni-kiel.de/~cpm/ Comments and suggestions for improvements are welcome! Best regards, Michael --- Some details about the new class `Data`: The class `Data` provides a strict equality operation `===`. Why? Look at the following "classical" functional logic definition of computing the last element of a list: last :: Eq a => [a] -> a last xs | _ ++ [x] == xs = x where x free Since `==` is part of the class `Eq`, it is defined on particular types in instance declarations. If these definitions are different from the standard `deriving` definitions, it might be possible that `last` computes an element which is not identical to the last element of the list. In Haskell, instances of `==` should be an equivalence relation (rather than "equality", although this is written in many papers and textbooks) so that `last` would compute an element equivalent to the last element. This leads to surprising results (see the "Data" paper for a deeper discussion). These problems are avoided with class `Data`. For each `data` declaration, `Data` instances for the defined type are automatically derived as long as the type is first-order (i.e., does not contain functional types). Hence it is ensured that `===` denotes equality rather than equivalence. Thus, last :: Data a => [a] -> a last xs | _ ++ [x] === xs = x where x free Moreover, free variable have type class constraint `Data` so that they denote first-order values. From a declarative point of view, a free value is equivalent to the non-deterministic value generator `aValue` which is also defined in class `Data`, see > pakcs ... Prelude> aValue :: Maybe Bool Nothing Just False Just True This is the only real change with PAKCS 3.x: There are no "polymorphic" free variables since a free variable has always the class constraint `Data`. ---

1 0

New homepage for Curry
by Michael Hanus 22 Nov '20

22 Nov '20

Hi, maybe some of you already noticed it, but I'd like to inform you that we created a new home page for Curry, see http://curry-lang.org It does not replace all contents of the older homepage (which was actually a wiki) but it is intended as a first entry point for Curry. It provides a short description of to the main features, ecosystems, and quick links to implementations, packages and other stuff. Thus, bookmark it or link it from your web pages! The homepage should not replace the wiki (which contains much more information). Nevertheless, if you have suggestions for improvement or adding further information, please mail them. If you look into the "Download" area, you see also links to quite new stable versions of PAKCS and KiCS2 (tar files and docker images). All the best, Michael

4 7