Abstract Canonical Inference

Details Abstract Canonical Inference Abstract Canonical Inference

2004-06-17

arxiv.org/abs/cs/0406030v2

Computer Science

Logic in Computer Science

28 pages, no figures, to appear in ACM Trans. on Computational Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Abstract Canonical Inference does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Abstract Canonical Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abstract Canonical Inference will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178060