1. Bledsoe, W., ‘A new method for proving certain Presburger formulas’, inProceedings of the Fourth IJCAI, Tbilisi, U.S.S.R. (1975), pp. 15–21.
2. BledsoeW., ‘Some proofs in analysis’, inContemporary Mathematics, Vol. 29, Automated Theorem Proving: After 25 Years, ed. W.Bledsoe and D.Loveland, American Mathematical Society, Providence, Rhode Island (1984), pp. 89–118.
3. BledsoeW., and HinesL. M., ‘Variable elimination and chaining in a resolution-based prover for inequalities’, inProceedings of the Fifth International Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, Vol. 87, ed. W.Bibel and R.Kowalski, Springer-Verlag, New York (1980), pp. 70–87.
4. BledsoeW., KunenK., and ShostakR., ‘Completeness results for inequality provers’,Artificial Intelligence 27, 255–288 (1985).
5. Digricoli, V., ‘The efficiency of RUE resolution, experimental results and heuristic theory’ inProceedings of the Seventh International Joint Conference on Artificial Intelligence, University of British Columbia, Vancouver (1981), pp. 539–547.