English

Non-Ground Congruence Closure

Logic in Computer Science 2025-05-29 v2

Abstract

Congruence closure on ground equations is a well-established and efficient algorithm for deciding ground equalities. It constructs an explicit representation of ground equivalence classes based on a given set of input equations, allowing ground equalities to be decided by membership. In many applications, these ground equations originate from grounding non-ground equations. We propose an algorithm that directly computes a non-ground representation of ground congruence classes for non-ground equations. Our approach is sound and complete with respect to the corresponding ground congruence classes. Experimental results demonstrate that computing non-ground congruence classes often outperforms the classical ground congruence closure algorithm in efficiency.

Keywords

Cite

@article{arxiv.2412.10066,
  title  = {Non-Ground Congruence Closure},
  author = {Hendrik Leidinger and Christoph Weidenbach},
  journal= {arXiv preprint arXiv:2412.10066},
  year   = {2025}
}
R2 v1 2026-06-28T20:33:46.528Z