An Improved Algorithm for E-Generalization
Logic in Computer Science
2017-09-05 v1 Artificial Intelligence
Abstract
E-generalization computes common generalizations of given ground terms w.r.t. a given equational background theory E. In 2005 [arXiv:1403.8118], we had presented a computation approach based on standard regular tree grammar algorithms, and a Prolog prototype implementation. In this report, we present algorithmic improvements, prove them correct and complete, and give some details of an efficiency-oriented implementation in C that allows us to handle problems larger by several orders of magnitude.
Cite
@article{arxiv.1709.00744,
title = {An Improved Algorithm for E-Generalization},
author = {Jochen Burghardt},
journal= {arXiv preprint arXiv:1709.00744},
year = {2017}
}
Comments
37 pages; 19 figures; complete C source sode available via ancillary files