Some Experiments with Twee-Style Goal-Directedness

8 pages•Published: October 24, 2026

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. Both approaches have complementary applications and show very promising results.

Keyphrases: automated theorem proving, goal directed search, search heuristics, shared terms

In: Stephan Schulz, Konstantin Korovin and Michael Rawson (editors). Proceedings of 16th International Workshop on the Implementation on Logics. Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning (short papers), vol 23, pages 90-97.

Links:	https://easychair.org/publications/paper/sKrz
	https://doi.org/10.29007/trm4

BibTeX entry

@inproceedings{IWIL-2026:Some_Experiments_with_Twee,
  author    = {Stephan Schulz},
  title     = {Some Experiments with Twee-Style Goal-Directedness},
  booktitle = {Proceedings of 16th International Workshop on the Implementation on Logics. Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning (short papers)},
  editor    = {Stephan Schulz and Konstantin Korovin and Michael Rawson},
  series    = {Kalpa Publications in Computing},
  volume    = {23},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/sKrz},
  doi       = {10.29007/trm4},
  pages     = {90-97},
  year      = {2026}}

Download PDF Open PDF in browser