English

KBCV 2.0 - Automatic Completion Experiments

Logic in Computer Science 2015-05-07 v1

Abstract

This paper describes the automatic mode of the new version of the Knuth-Bendix Completion Visualizer. The internally used data structures have been overhauled and the performance was dramatically improved by introducing caching, parallelization, and term- indexing in the computation of critical pairs and simplification. The new version is much faster and can complete three more systems.

Cite

@article{arxiv.1505.01338,
  title  = {KBCV 2.0 - Automatic Completion Experiments},
  author = {Thomas Sternagel},
  journal= {arXiv preprint arXiv:1505.01338},
  year   = {2015}
}

Comments

IWC 2013

R2 v1 2026-06-22T09:29:03.608Z