E3Solver: decision tree unification by enumeration

10/19/2017
by   M. Ammar Ben Khadra, et al.
0

We introduce E3Solver, a unification-based solver for programming-by-example (PBE) participating in the 2017 edition of the SyGuS Competition. Our tool proceeds in two phases. First, for each individual example, we enumerate a terminal expression consistent with it. Then, we unify these expressions using conditional expressions in a decision tree. To this end, a suitable condition is enumerated for each pair of conflicting examples. This incremental method terminates after fitting all examples in the decision tree. E3Solver solves all 750 instances in the bitvector sub-track in an average time of few seconds each. We make our contributions publicly available (https://github.com/sygus-tools)

READ FULL TEXT

page 1

page 2

research
09/11/2022

Rethink Decision Tree Traversal

We will show how to implement binary decision tree traversal in the lang...
research
02/24/2018

Extremely Fast Decision Tree

We introduce a novel incremental decision tree learning algorithm, Hoeff...
research
07/08/2020

Supervised machine learning techniques for data matching based on similarity metrics

Businesses, governmental bodies and NGO's have an ever-increasing amount...
research
02/26/2017

PubTree: A Hierarchical Search Tool for the MEDLINE Database

Keeping track of the ever-increasing body of scientific literature is an...
research
11/03/2020

Estimating decision tree learnability with polylogarithmic sample complexity

We show that top-down decision tree learning heuristics are amenable to ...
research
03/03/2022

MetaDT: Meta Decision Tree for Interpretable Few-Shot Learning

Few-Shot Learning (FSL) is a challenging task, which aims to recognize n...
research
12/16/2017

NDT: Neual Decision Tree Towards Fully Functioned Neural Graph

Though traditional algorithms could be embedded into neural architecture...

Please sign up or login with your details

Forgot password? Click here to reset