Abstract
We explore how different proof orderings induce different notions of saturation and completeness. We relate completion, paramodulation, saturation, redundancy elimination, and rewrite system reduction to proof orderings.
| Original language | English |
|---|---|
| Pages (from-to) | 120-132 |
| Number of pages | 13 |
| Journal | Electronic Notes in Theoretical Computer Science |
| Volume | 86 |
| Issue number | 1 |
| DOIs | |
| State | Published - May 2003 |
| Event | FTP'2003, 4th International Workshop on First-Order Theorem Proving (in Connection with RDP'03, Federated Conference on Rewriting, Deduction - Valencia, Spain Duration: 12 Jun 2003 → 14 Jun 2003 |