DOCSLIB.ORG

Genetic and Evolutionary Computation Conference 2020

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Genetic and Evolutionary Computation Conference 2020 Genetic and Evolutionary Computation Conference 2020 Conference Program Last updated: July 7, 2020 Cancún, México July 8-12, 2020 Page Welcome 3 Sponsors and Supporters 4 Organizers and Track Chairs 5 Program Committee 7 Proceedings 22 Time Zone 23 Schedule 25 Schedule at a Glance 26 Workshop and Tutorial Sessions 27 Paper Sessions Overview 29 Track List and Abbreviations 30 Keynotes 31 Tutorials 35 Workshops, Late Breaking Abstracts, and Women@GECCO 41 Humies, Competitions, Hot off the Press, and Job Market 55 Annual “Humies” Awards for Human-Competitive Results 56 Competitions 57 Hot Off the Press 60 Job Market 61 Best Paper Nominations 63 Voting Instructions 64 Papers and Posters 67 Friday, July 10, 10:30-12:10 68 Friday, July 10, 13:40-15:20 70 Friday, July 10, 15:40-17:20 72 Saturday, July 11, 13:40-15:20 74 Saturday, July 11, 15:40-17:20 76 Saturday, July 11, 17:40-19:20 79 Sunday, July 12, 09:00-10:40 82 Poster Session 1 84 Poster Session 2 89 Abstracts by Track 95 ACO-SI 96 CS 97 DETA 99 ECOM 100 EML 104 EMO 109 ENUM 113 GECH 115 GA 119 GP 122 HOP 126 RWA 127 SBSE 132 Theory 134 Author Index 137 GECCO is sponsored by the Association for Computing Machinery Special Interest Group for Genetic and Evolutionary Computation (SIGEVO). SIG Services: 2 Penn Plaza, Suite 701, New York, NY, 10121, USA, 1-800-342-6626 (USA and Canada) or +212-626-0500 (global). Welcome 3 Welcome Dear GECCO attendees, Welcome to the Genetic and Evolutionary Computation Conference (GECCO). After the tremendously successful GECCO 2019 in Prague, Czech Republic, GECCO came back to the Americas: to Cancún, México. Unfortunately, and because of the coronavirus crisis, GECCO became, for the first time, an online conference. GECCO is the largest peer-reviewed conference in the field of Evolutionary Computation, and the main conference of the Special Interest Group on Genetic and Evolutionary Computation (SIGEVO) of the Association for Computing Machinery (ACM). GECCO implements a rigorous and selective review process to identify the most important and technically sound papers to publish. The technical program is divided into thirteen tracks reflecting all aspects of our field and each of these tracks were chaired by two experts who managed the review process and made the decisions on the papers in coordination with the Editor-in-Chief. This year, we received 415 papers and accepted 149 of them, which results in a 36% acceptance rate. Those papers will be presented during the online conference using live streaming. We additionally accepted 132 posters that will also be presented in two online posters sessions. Besides the technical tracks, GECCO includes 42 tutorials selected from among 54 proposals as well as 21 workshops reflecting important topics in our field. They will take place during the first two days of the online conference, together with several competitions. We are thrilled to welcome as keynote speakers to Leslie Valiant, from Harvard University and Kalyanmoy Deb, from Michigan State University. We are also honored that Darrell Whitley will give the SIGEVO keynote this year. We would like to thank all authors for submitting their work to GECCO 2020. We also wish to thank all the tutorial speakers as well as to the workshop and competition organizers. The organization of a conference like GECCO is a tremendous task relying on many people. We sincerely appreciate their work. We would like to thank first to all our chairs: track, tutorials, workshops, publicity, competitions, late breaking abstracts, and hot off the press. We also thank the organizers of the Humies, and of Women@GECCO as well as to the members of our program committee. Some members of the organization team deserve a special mention and recognition: José A. Lozano, Editor-in-Chief, Josu Ceberio, Proceedings Chair, Arturo Hernández Aguirre, Local Chair and Gregorio Toscano Pulido, who was Publicity Chair but played a key role by developing a system that could make possible an online conference with a more friendly user interface. All of them spent long hours working to make this conference possible. We also thank Ahmed Kheiri for allowing us to use his algorithm to optimize the schedule of the conference. It is also worth mentioning the hard work done by Brenda Ramirez and Roxane Rose who helped us with the registrations and the logistics of the event. Finally, we also thank Franz Rothlauf, Enrique Alba, Darrell Whitley, Jürgen Branke and Peter Bosman from SIGEVO for their valuable advice and guidance. On behalf GECCO, we would also like to thank Uber, Beacon and CINVESTAV-IPN for their sponsorship and support. Enjoy the conference! Carlos A. Coello Coello GECCO 2020 General Chair CINVESTAV-IPN Mexico City (México) 4 Sponsors and Supporters Sponsors and Supporters We gratefully acknowledge and thank our sponsors: Bronze sponsors: Other sponsors: Organizers and Track Chairs 5 Organizers General Chair: Carlos Artemio Coello Coello, CINVESTAV-IPN México Editor-in-Chief: Jose A. Lozano, University of the Basque Country (UPV/EHU), Basque Centre for Applied Mathematics (BCAM) Local Chair: Arturo Hernández Aguirre, Center for Research in Mathematics (CIMAT) Proceedings Chair: Josu Ceberio, University of the Basque Country (UPV/EHU) Publicity Chairs: Gregorio Toscano Pulido, Cinvestav Tamaulipas Mario Garza Fabre, Cinvestav Tamaulipas Electronic Media Chairs: Nadarajen Veerapen, University of Lille Tutorials Chair: Efrén Mezura Montes, University of Veracruz, Artificial Intelligence Research Center Workshops Chairs: Richard Allmendinger, University of Manchester Hugo Terashima Marín, Tecnológico de Monterrey Competitions Chair: Markus Wagner, University of Adelaide Hot off The Press: Heike Trautmann, University of Münster Late-Breaking Abstracts: Ke Tang, Southern University of Science and Technology Annual "Hummies Awards for John Koza, Standford University Human Competitive Results": Erik Goodman, University of Michigan William B. Langdon, University College London Women GECCO: Elizabeth Wanner, Aston University Leslie Angélica Pérez Cáceres, Pontificia Universidad Católica de Valparaíso Job Market: Tea Tušar, Jozef Stefan Institute Boris Naujoks, TH Köln - Cologne University of Applied Sciences Business Committee: Peter A.N. Bosman, Delft University of Technology Darrell Whitley, Colorado State University SIGEVO Officers: Franz Rothlauf (Chair), Universität Mainz Jürgen Branke (Vice Chair), University of Warwick Enrique Alba (Treasurer), University of Málaga Peter A.N. Bosman (Secretary), Delft University of Technology Markus Wagner (Sustainability), University of Adelaide 6 Organizers and Track Chairs Track Chairs ACO-SI — Ant Colony Optimization and Swarm Intelligence Marde Helbig, Griffith University Christine Solnon, LIRIS, INSA de Lyon CS — Complex Systems (Artificial Life/Artificial Immune Systems/Generative and Developmental Systems/Evolutionary Robotics/Evolvable Hardware) Stéphane Doncieux, Sorbonne University, CNRS Dennis G. Wilson, ISAE-SUPAERO DETA — Digital Entertainment Technologies and Arts Francisco Fernández de Vega, Universidad de Extremadura Vanessa Volz, modl.ai ECOM — Evolutionary Combinatorial Optimization and Metaheuristics Francisco Chicano, University of Malaga Luis Paquete, University of Coimbra EML — Evolutionary Machine Learning Jaume Bacardit, Newcastle University Bing Xue, Victoria University of Wellington EMO — Evolutionary Multiobjective Optimization Jonathan Edward Fieldsend, University of Exeter Sanaz Mostaghim, University of Magdeburg ENUM — Evolutionary Numerical Optimization Dirk V. Arnold, Dalhousie University Oliver Schuetze, CINVESTAV-IPN GA — Genetic Algorithms Gabriela Ochoa, University of Stirling Carlos Segura, Centro de Investigación en Matemáticas (CIMAT) GECH — General Evolutionary Computation and Hybrids Carlos Cotta, University of Málaga Michael T. M. Emmerich, LIACS GP — Genetic Programming Miguel Nicolau, University College Dublin Mengjie Zhang, Victoria University of Wellington RWA — Real World Applications Robin Purshouse, University of Sheffield Tapabrata Ray, University of New South Wales SBSE — Search-Based Software Engineering Fuyuki Ishikawa, National Institute of Informatics Justyna Petke, University College London Theory Johannes Lengler, ETH Zürich Frank Neumann, The University of Adelaide Program Committee 7 Program Committee (Proceedings) Ashraf Abdelbar, Brandon University do Norte Adnan Acan, Eastern Mediterranean University Ying Bi, Victoria University of Wellington Jason Adair, University of Stirling Rafał Biedrzycki, Institute of Computer Science, Warsaw Adekunle Rotimi Adekoya, Stellenbosch University, University University of Technology of Pretoria Mauro Birattari, Université Libre de Bruxelles Michael Affenzeller, University of Applied Science Upper Aus- Julian Blank, Michigan State University tria; Institute for Formal Models and Verification,Johannes Maria J. Blesa, Universitat Politècnica de Catalunya - Keppler University Linz BarcelonaTech Youhei Akimoto, University of Tsukuba, RIKEN AIP Aymeric Blot, University College London Mohammad Majid al-Rifaie, University of Greenwich Lashon Booker, The MITRE Corporation Harith Al-Sahaf, Victoria University of Wellington Peter A.N. Bosman, Centre for Mathematics and Computer Ines Alaya, Ecole Nationale des Sciences de l’Informatique Science, Delft University of Technology (ENSI), Université de la Manouba Jakob Bossek, The University of Adelaide Wissam Albukhanajer, Roke Manor Research Limited Amine Boumaza, Université de Lorraine / LORIA, Loria Tanja Alderliesten, Leiden University
Load more

Recommended publications
  • Program Synthesis with Grammars and Semantics in Genetic Programming
    Program Synthesis with Grammars and Semantics in Genetic Programming Stefan Forstenlechner UCD student number: 14204817 The thesis is submitted to University College Dublin in fulfilment of the requirements for the degree of DOCTOR OF PHILOSOPHY School of Business Head of School: Prof. Anthony Brabazon Research Supervisors: Prof. Michael O’Neill Dr. Miguel Nicolau External Examiner: Dr. John R. Woodward January 2019 Contents Contents i Abstract vii Statement of Original Authorship viii Acknowledgements ix List of Figures xi List of Tables xiv List of Algorithms xvii List of Abbreviations xviii Publications Arising xx I Introduction and Literature Review 1 1 Introduction 2 1.1 Aim of Thesis . .3 1.2 Research Questions . .4 1.3 Contributions . .7 1.3.1 Technical contributions . .8 1.4 Limitations . .8 1.5 Thesis Outline . .9 i CONTENTS 2 Related Work 12 2.1 Evolutionary Computation . 12 2.2 Genetic Programming . 14 2.2.1 Representation . 15 2.2.2 Initialization . 16 2.2.3 Fitness . 17 2.2.4 Selection . 17 2.2.5 Crossover . 19 2.2.6 Mutation . 19 2.2.7 GP Summary . 20 2.2.8 Grammars . 20 2.3 Program Synthesis . 23 2.3.1 Program Synthesis in Genetic Programming . 26 2.3.2 General Program Synthesis Benchmark Suite . 30 2.4 Semantics . 32 2.4.1 Semantic operators . 34 2.4.2 Geometric Semantic GP . 37 2.5 Conclusion . 38 II Experimental Research 40 3 General Grammar Design 41 3.1 Grammars for G3P . 41 3.2 Sorting Network . 42 3.3 Structure in Grammars . 43 3.4 Sorting Network Grammar Design .
    [Show full text]
  • Artificial Intelligence and Strategic Trade Controls
    Technical Report Artificial Intelligence and Strategic Trade Controls Strategic Trade Research Institute Center for International and Security Studies at Maryland June 2020 , The authors of this report invite liberal use of the information provided, requiring only that the reproduced material clearly cite the source, using: Andrea Viski, Scott Jones, Lindsay Rand, Tucker Boyce, and Jonas Siegel, “Artificial Intelligence and Strategic Trade Controls,” Strategic Trade Research Institute and Center for International and Security Studies at Maryland, June 2020. Report Design and Layout by Andrea Viski Copyright 2020, Strategic Trade Research Institute and Center for International and Security Studies at Maryland Printed in the United States of America Artificial Intelligence and Strategic Trade Controls Acknowledgments The authors would like to sincerely thank the participants of the dialogue on Emerging Technologies and Strategic Trade Controls held at the Stimson Center in Washington DC on March 14, 2019, as well as the participants of the dialogue on Artificial Intelligence and Strategic Trade Controls held at the Ronald Reagan International Trade Center on March 9, 2020. The authors would also like to thank Amy Nelson, Kevin Wolf, Carl Wocke, Aaron Mannes, Timothy Gildea, Aaron Arnold, Todd Perry, Nancy Gallagher, and Richard Cupitt for their support, comments, ideas, and feedback on this report. About the Strategic Trade Research Institute The Strategic Trade Research Institute was founded in 2017 and is an independent, international, board-governed non-profit organization dedicated to building networks of strategic trade research and practice through leadership, research, and innovation. STRI publishes the Strategic Trade Review, the leading peer reviewed journal dedicated to trade and security.
    [Show full text]
  • Letters to the Editor
    Articles Letters to the Editor Research Priorities for is a product of human intelligence; we puter scientists, innovators, entrepre - cannot predict what we might achieve neurs, statisti cians, journalists, engi - Robust and Beneficial when this intelligence is magnified by neers, authors, professors, teachers, stu - Artificial Intelligence: the tools AI may provide, but the eradi - dents, CEOs, economists, developers, An Open Letter cation of disease and poverty are not philosophers, artists, futurists, physi - unfathomable. Because of the great cists, filmmakers, health-care profes - rtificial intelligence (AI) research potential of AI, it is important to sionals, research analysts, and members Ahas explored a variety of problems research how to reap its benefits while of many other fields. The earliest signa - and approaches since its inception, but avoiding potential pitfalls. tories follow, reproduced in order and as for the last 20 years or so has been The progress in AI research makes it they signed. For the complete list, see focused on the problems surrounding timely to focus research not only on tinyurl.com/ailetter. - ed. the construction of intelligent agents making AI more capable, but also on Stuart Russell, Berkeley, Professor of Com - — systems that perceive and act in maximizing the societal benefit of AI. puter Science, director of the Center for some environment. In this context, Such considerations motivated the “intelligence” is related to statistical Intelligent Systems, and coauthor of the AAAI 2008–09 Presidential Panel on standard textbook Artificial Intelligence: a and economic notions of rationality — Long-Term AI Futures and other proj - Modern Approach colloquially, the ability to make good ects on AI impacts, and constitute a sig - Tom Dietterich, Oregon State, President of decisions, plans, or inferences.
    [Show full text]
  • Annual Report 2012-13
    Annual Report 2012-2013 Director’s Report Honourable President of India Shri Pranab Mukherjee, Honourable Governor of Uttar Pradesh Shri B. L. Joshi, Honourable Chairman, Board of Governors of the Indian Institute of Technology Kanpur, Professor M. Anandakrishnan, Shri N. R. Narayana Murthy, Executive Chairman of Infosys Limited, Professor Ashoke Sen, Harish- Chandra Research Institute, Allahabad, Members of the Board of Governors, Members of the Academic Senate, all graduating students and their family members, members of faculty, staff and students, invited dignitaries, guests, and members of the media: I heartily welcome you all on this occasion of the forty-fifth convocation of the Indian Institute of Technology Kanpur. Academic Activities The academic year closing in June 2013 has been momentous, and I consider it a privilege to review our activities pertaining to this period. I am very happy to share with you that 132 Ph. D students have graduated over the last academic year. The number of graduating students at the undergraduate level was 691 and at the postgraduate level it was 636. Awards and Honours Reporting about the awards and honors won by our faculty and students is always a proud moment for the Director. It gives me enormous sense of pride to share with you that Professor Sanjay G. Dhande, former Director of the Institute and Professor Manindra Agrawal (CSE) have been conferred Padma Shri by the Government of India. The many prestigious scholarships and awards received by our students have been a matter of pride and pleasure for us. This year 8 Japanese TODAI scholarships were awarded to IITK students.
    [Show full text]
  • Learning Functional Programs with Function Invention and Reuse
    Learning functional programs with function invention and reuse Andrei Diaconu University of Oxford arXiv:2011.08881v1 [cs.PL] 17 Nov 2020 Honour School of Computer Science Trinity 2020 Abstract Inductive programming (IP) is a field whose main goal is synthe- sising programs that respect a set of examples, given some form of background knowledge. This paper is concerned with a subfield of IP, inductive functional programming (IFP). We explore the idea of generating modular functional programs, and how those allow for function reuse, with the aim to reduce the size of the programs. We introduce two algorithms that attempt to solve the problem and explore type based pruning techniques in the context of modular programs. By experimenting with the imple- mentation of one of those algorithms, we show reuse is important (if not crucial) for a variety of problems and distinguished two broad classes of programs that will generally benefit from func- tion reuse. Contents 1 Introduction5 1.1 Inductive programming . .5 1.2 Motivation . .6 1.3 Contributions . .7 1.4 Structure of the report . .8 2 Background and related work 10 2.1 Background on IP . 10 2.2 Related work . 12 2.2.1 Metagol . 12 2.2.2 Magic Haskeller . 13 2.2.3 λ2 ............................. 13 2.3 Invention and reuse . 13 3 Problem description 15 3.1 Abstract description of the problem . 15 3.2 Invention and reuse . 19 4 Algorithms for the program synthesis problem 21 4.1 Preliminaries . 22 4.1.1 Target language and the type system . 22 4.1.2 Combinatorial search .
    [Show full text]
  • Digital Transformation Review Eleventh Edition
    Digital Transformation Review Eleventh Edition Artificial Intelligence Decoded 2 Artificial Intelligence Decoded Digital Transformation Review Eleventh Edition Artificial Intelligence Decoded Edited by Capgemini Research Institute About the Capgemini Research Institute: The Capgemini Research Institute is Capgemini’s in-house think-tank on all things digital. The Institute publishes research on the impact of digital technologies on large traditional businesses. The team draws on the worldwide network of Capgemini experts and works closely with academic and technology partners. The Institute has dedicated research centers in India, the United Kingdom, and the United States. @capgemini #DTR11 www.capgemini.com/the-digital-transformation-institute Artificial Intelligence Decoded 3 Contents 06 Academia Lanny Cohen’s foreword 32 Professor Luciano Floridi, University of Oxford AI: Adaptable Intelligence 08 Editorial Artificial Intelligence: Preparing Organizations and their People for 38 Drastic Change Michael Schrage, MIT AI: Survival of the Smartest View from Large Organizations The ‘Valley’ 16 Michael Natusch, Prudential Plc 46 AI: Augmented Intelligence Frank Chen, a16z Matches People and Machines Make AI a Daily Habit 22 56 Rajen Sheth, Atif Rafiq, Google Volvo Cars Putting AI to Work: With Customers Democratizing AI for Traditional and Within the Enterprise Businesses 4 Artificial Intelligence Decoded 62 Capgemini Babak Hodjat, Perspective Sentient Technologies AI: Already Delivering Measurable Results across Sectors 92 Turning AI Into
    [Show full text]
  • Program Synthesis with Types
    University of Pennsylvania ScholarlyCommons Publicly Accessible Penn Dissertations 2015 Program Synthesis With Types Peter-Michael Santos Osera University of Pennsylvania, [email protected] Follow this and additional works at: https://repository.upenn.edu/edissertations Part of the Computer Sciences Commons Recommended Citation Osera, Peter-Michael Santos, "Program Synthesis With Types" (2015). Publicly Accessible Penn Dissertations. 1926. https://repository.upenn.edu/edissertations/1926 This paper is posted at ScholarlyCommons. https://repository.upenn.edu/edissertations/1926 For more information, please contact [email protected]. Program Synthesis With Types Abstract Program synthesis, the automatic generation of programs from specification, promises to fundamentally change the way that we build software. By using synthesis tools, we can greatly speed up the time it takes to build complex software artifacts as well as construct programs that are automatically correct by virtue of the synthesis process. Studied since the 70s, researchers have applied techniques from many different sub-fields of computer science ot solve the program synthesis problem in a variety of domains and contexts. However, one domain that has been less explored than others is the domain of typed, functional programs. This is unfortunate because programs in richly-typed languages like OCaml and Haskell are known for ``writing themselves'' once the programmer gets the types correct. In light of this observation, can we use type theory to build more expressive and efficient type-directed synthesis systems for this domain of programs? This dissertation answers this question in the affirmative by building novel type- theoretic foundations for program synthesis. By using type theory as the basis of study for program synthesis, we are able to build core synthesis calculi for typed, functional programs, analyze the calculi's meta-theoretic properties, and extend these calculi to handle increasingly richer types and language features.
    [Show full text]
  • Program Synthesis
    Program Synthesis Program Synthesis Sumit Gulwani Microsoft Research [email protected] Oleksandr Polozov University of Washington [email protected] Rishabh Singh Microsoft Research [email protected] Boston — Delft Foundations and Trends® in Programming Languages Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is S. Gulwani, O. Polozov and R. Singh. Program Synthesis. Foundations and Trends® in Programming Languages, vol. 4, no. 1-2, pp. 1–119, 2017. ® This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-292-1 © 2017 S. Gulwani, O. Polozov and R. Singh All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for in- ternal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged.
    [Show full text]
  • Human-Computer Interaction 10Th International Conference Jointly With
    Human-Computer Interaction th 10 International Conference jointly with: Symposium on Human Interface (Japan) 2003 5th International Conference on Engineering Psychology and Cognitive Ergonomics 2nd International Conference on Universal Access in Human-Computer Interaction 2003 Final Program 22-27 June 2003 • Crete, Greece In cooperation with: Conference Centre, Creta Maris Hotel Chinese Academy of Sciences Japan Management Association Japan Ergonomics Society Human Interface Society (Japan) Swedish Interdisciplinary Interest Group for Human-Computer Interaction - STIMDI Associación Interacción Persona Ordenador - AIPO (Spain) InternationalGesellschaft für Informatik e.V. - GI (Germany) European Research Consortium for Information and Mathematics - ERCIM HCI www.hcii2003.gr Under the auspices of a distinguished international board of 114 members from 24 countries Conference Sponsors Contacts Table of Contents HCI International 2003 HCI International 2003 HCI International 2003 Welcome Note 2 Institute of Computer Science (ICS) Foundation for Research and Technology - Hellas (FORTH) Conference Registration - Secretariat Foundation for Research Thematic Areas & Program Boards 3 Science and Technology Park of Crete Conference Registration takes place at the Conference Secretariat, located at and Technology - Hellas Heraklion, Crete, GR-71110 the Olympus Hall, Conference Centre Level 0, during the following hours: GREECE Institute of Computer Science Saturday, June 21 14:00 – 20:00 http://www.ics.forth.gr Opening Plenary Session FORTH Tel.:
    [Show full text]
  • Template-Based Program Verification and Program Synthesis
    Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) Template-based Program Verification and Program Synthesis Saurabh Srivastava? and Sumit Gulwani?? and Jeffrey S. Foster??? University of California, Berkeley and Microsoft Research, Redmond and University of Maryland, College Park Received: date / Revised version: date Abstract. Program verification is the task of automat- the subsequent step of writing the program in C, C++, ically generating proofs for a program's compliance with Java etc. There is additional effort in ensuring that all a given specification. Program synthesis is the task of corner cases are covered, which is a tiresome and man- automatically generating a program that meets a given ual process. The dilligent programmer will also verify specification. Both program verification and program syn- that the final program is not only correct but also me- thesis can be viewed as search problems, for proofs and chanically verifiable, which usually requires them to add programs, respectively. annotations illustrating the correctness. For these search problems, we present approaches This makes programming a subtle task, and the ef- based on user-provided insights in the form of templates. fort involved in writing correct programs is so high that Templates are hints about the syntactic forms of the in- in practice we accept that programs can only be approx- variants and programs, and help guide the search for imately correct. While developers do realize the pres- solutions. We show how to reduce the template-based ence of corner cases, the difficulty inherent in enumer- search problem to satisfiability solving, which permits ating and reasoning about them, or using a verification the use of off-the-shelf solvers to efficiently explore the framework, ensures that developers typically leave most search space.
    [Show full text]
  • The AI Path: Past, Present & Future
    Digital Business The AI Path: Past, Present and Future Just as computing and the World-Wide Web progressed through stages of maturity on the way to full acceptance, artificial intelligence is destined to do the same. By understanding the comparable challenges that were overcome and benefits achieved with earlier technologies, organizations can better see today where AI is heading and ensure that they are properly positioned to reap its full value. October 2019 Digital Business Executive Summary Computing power is something that we now take for granted — if we even think about it at all. In fact, this computing capacity came about following decades of astounding leaps of ingenious engineering that provided a fertile ground for business and social innovations to follow. Our most basic tasks in ordering goods, using smartphones and switching TV channels with our voice now rely on computing power scarcely imaginable even a few decades ago. The lessons of how this took hold and became foundational are relevant in the context of today’s coming-of-age megatrend — AI. Another example is the internet and the web, which allowed social and network connections to grow atop this prior breakthrough in computing power. The earlier rise of distributed and personal computing power, by itself, did not change society or business; such change required connections, networking, and a shift to a more collaborative and sharing mindset. The web’s protocols reached a critical mass of acceptance and created the nucleus that attracted new joiners and made today’s internet-based and web services possible. Similarly, there are lessons in how barriers to adoption were overcome in the web’s march to success that are relevant to AI.
    [Show full text]
  • Logic Program Synthesis
    J. LOGIC PROGRAMMING 1993:12:1{199 1 LOGIC PROGRAM SYNTHESIS YVES DEVILLE AND KUNG-KIU LAU > This pap er presents an overview and a survey of logic program synthesis. Logic program synthesis is interpreted here in a broad way; it is concerned with the following question: given a sp eci cation, howdowe get a logic pro- gram satisfying the sp eci cation? Logic programming provides a uniquely nice and uniform framework for program synthesis since the sp eci cation, the synthesis pro cess and the resulting program can all b e expressed in logic. Three main approaches to logic program synthesis by formal metho ds are describ ed: constructive synthesis, deductivesynthesis and inductive syn- thesis. Related issues such as correctness and veri cation as well as syn- thesis by informal metho ds are brie y presented. Our presentation is made coherentbyemploying a uni ed framework of terminology and notation, and by using the same running example for all the approaches covered. This pap er thus intends to provide an assessment of existing work and a framework for future research in logic program syn- thesis. < 1. INTRODUCTION Program synthesis refers to the elab oration of a program in some systematic man- ner, starting from a sp eci cation, that is a statement describing what the program should do. A sp eci cation mayhavemany forms. We can distinguish formal sp eci- cations from informal ones. For the latter, the synthesis pro cess cannot b e totally formalised and can only b e partially automated. Wethus distinguish b etween syn- thesis by formal methods and synthesis by informal methods .
    [Show full text]