All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Combining Top-Down and Bottom-Up Approaches for Automated Discovery of Typed Programs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F17%3A00490832" target="_blank" >RIV/67985807:_____/17:00490832 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/SSCI.2017.8285209" target="_blank" >http://dx.doi.org/10.1109/SSCI.2017.8285209</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/SSCI.2017.8285209" target="_blank" >10.1109/SSCI.2017.8285209</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Combining Top-Down and Bottom-Up Approaches for Automated Discovery of Typed Programs

  • Original language description

    Automated program discovery has been mainly approached via Genetic Programming, which represents the search space of programs implicitly by a collection of individuals. In this paper, we propose a way of representing program search space explicitly, with a top-down hierarchy of semi-constructed programs. Together with a bottom-up generation procedure, we maintain an overview of the overall search space structure, while being able to quickly get samples from the fringe. Moreover, having a type system with parametric polymorphism allows us to limit the state space size using type level programming while keeping a complete control over program sizes. Our approach can naturally be used for searching the space of programs using tree search methods. We back this claim by a simple experiment utilizing a Monte-Carlo Tree Search algorithm, though other search methods (such as A*) might be used as well.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA15-19877S" target="_blank" >GA15-19877S: Automated Knowledge and Plan Modeling for Autonomous Robots</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    SSCI 2017 IEEE Symposium Series on Computational Intelligence

  • ISBN

    978-1-5386-2726-6

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    938-945

  • Publisher name

    IEEE

  • Place of publication

    New York

  • Event location

    Honolulu

  • Event date

    Nov 27, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000428251401003