KBCV 2.0 - Automatic Completion Experiments
Thomas Sternagel
TL;DR
KBCV 2.0 is an improved version of the Knuth-Bendix Completion Visualizer that significantly enhances performance through data structure overhaul, caching, parallelization, and term-indexing, enabling it to complete more systems efficiently.
Contribution
The paper introduces a new version of KBCV with optimized data structures and parallel processing, achieving faster completion of more systems.
Findings
Performance improved dramatically with new optimizations
Can complete three more systems than previous version
Significantly faster completion times
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Parallel Computing and Optimization Techniques · Scientific Computing and Data Management