Ground Canonicity
Logic in Computer Science
2007-05-23 v1
Abstract
We explore how different proof orderings induce different notions of saturation. We relate completion, paramodulation, saturation, redundancy elimination, and rewrite system reduction to proof orderings.
Cite
@article{arxiv.cs/0304017,
title = {Ground Canonicity},
author = {Nachum Dershowitz},
journal= {arXiv preprint arXiv:cs/0304017},
year = {2007}
}