Fingerprinting Logic Programs
<|reference_start|>Fingerprinting Logic Programs: In this work we present work in progress on functionality duplication detection in logic programs. Eliminating duplicated functionality recently became prominent in context of refactoring. We describe a quantitative approach that allows to measure the ``similarity'' between two predicate definitions. Moreover, we show how to compute a so-called ``fingerprint'' for every predicate. Fingerprints capture those characteristics of the predicate that are significant when searching for duplicated functionality. Since reasoning on fingerprints is much easier than reasoning on predicate definitions, comparing the fingerprints is a promising direction in automated code duplication in logic programs.<|reference_end|>
@article{serebrenik2007fingerprinting,
    title={Fingerprinting Logic Programs},
    author={Alexander Serebrenik and Wim Vanhoof},
    journal={arXiv preprint arXiv:cs/0701081},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0701081},
    primaryClass={cs.PL cs.SE}
}