2003/04/10 by Nachum Dershowitz, Dershowitz, Nachum
Computer Science · #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0304017
arxiv created 2003/04/10 · arxiv updated 2009/11/30
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.