Dice Question Streamline Icon: https://streamlinehq.com

Pruning techniques for bottom-up SemGuS enumerators

Develop an appropriate pruning technique for bottom-up enumeration in the SemGuS framework that effectively reduces the search space for imperative semantics where standard observational equivalence does not readily apply to sub-programs.

Information Square Streamline Icon: https://streamlinehq.com

Background

The bottom-up enumerator constructs subterms by increasing size or height and typically applies observational equivalence to prune duplicates. However, in SemGuS with imperative semantics, sub-program input states can differ from top-level inputs due to state changes during execution, making straightforward observational-equivalence pruning infeasible.

The authors explicitly state that devising a suitable pruning technique for bottom-up enumeration in SemGuS remains open and suggest potential directions such as equality saturation and lifted interpretation.

References

The development of an appropriate pruning technique for a bottom-up SemGuS enumerator is an open research question, which we hope this toolkit will help researchers work on, for example by building on approaches such as equality saturation and lifting interpretation to sets of programs.

The SemGuS Toolkit (2406.01792 - Johnson et al., 3 Jun 2024) in Section 3.2 (Baseline Enumerative solvers)