Abstract Canonical Inference
Logic in Computer Science
2015-02-11 v2 Symbolic Computation
Abstract
An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and rewrite-system reduction are connected to proof orderings. Fairness of deductive mechanisms is defined in terms of proof orderings, distinguishing between (ordinary) "fairness," which yields completeness, and "uniform fairness," which yields saturation.
Cite
@article{arxiv.cs/0406030,
title = {Abstract Canonical Inference},
author = {Maria Paola Bonacina and Nachum Dershowitz},
journal= {arXiv preprint arXiv:cs/0406030},
year = {2015}
}
Comments
28 pages, no figures, to appear in ACM Trans. on Computational Logic