Nachum Dershowitz 
<P>
Abstract Fair Inference
<P>
We describe an abstract framework of canonical inference,
explore how
different proof orderings induce different variations
of saturation and completeness, and consider fairness of inference 
conditions
that ensure completeness.
<P>
The talk will be based on a paper presented at the Workshop on 
First-Order Theorem Proving and a
joint paper with Claude Kirchner presented at the Symposium on Logic in 
Computer Science.