English

Some Experiments with Twee-Style Goal-Directedness

Logic in Computer Science 2026-07-29 v1 Symbolic Computation

Abstract

In saturation-based theorem proving, selecting the next clause for processing is a major concern. Twee has successfully applied the idea of preferring clauses that share terms with the conjecture by adding equational definitions to transform the problem. In this paper, we apply the idea to the full first-order case, and offer an alternative implementation based on shared terms that shows very promising results.

Cite

@article{arxiv.2607.27442,
  title  = {Some Experiments with Twee-Style Goal-Directedness},
  author = {Stephan Schulz},
  journal= {arXiv preprint arXiv:2607.27442},
  year   = {2026}
}