ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description)

13 Feb 2020Jan JakubůvKarel ChvalovskýMiroslav OlšákBartosz PiotrowskiMartin SudaJosef Urban

We describe an implementation of gradient boosting and neural guidance of saturation-style automated theorem provers that does not depend on consistent symbol names across problems. For the gradient-boosting guidance, we manually create abstracted features by considering arity-based encodings of formulas... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.