James R. Slagle

• James R. Slagle. A heuristic program that solves symbolic integration problems in freshman calculus. Journal of the ACM, 10(4):507-520, October 1963. Citations.

• James R. Slagle. An efficient algorithm for finding certain minimum-cost procedures for making binary decisions. Journal of the ACM, 11(3):253-264, July 1964. Citations.

• James R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the ACM, 14(4):687-697, October 1967. References and Citations.

• James R. Slagle and Philip Bursky. Experiments with a multipurpose, theorem-proving heuristic program. Journal of the ACM, 15(1):85-99, January 1968. References and Citations.

• James R. Slagle and John K. Dixon. Experiments with some programs that search game trees. Journal of the ACM, 16(2):189-207, April 1969. References, Citations, etc.

• James R. Slagle. Interpolation theorems for resolution in lower predicate calculus. Journal of the ACM, 17(3):535-542, July 1970. References, Citations, etc.

• C. L. Chang and J. R. Slagle. Completeness of linear refutation for theories with equality. Journal of the ACM, 18(1):126-136, January 1971. References, Citations, etc.

• James R. Slagle. Automatic theorem proving with built-in theories including equality, partial ordering, and sets. Journal of the ACM, 19(1):120-135, January 1972. References, Citations, etc.

• James R. Slagle. An approach for finding C-linear complete inference systems. Journal of the ACM, 19(3):496-516, July 1972. References, Citations, etc.

• James R. Slagle. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal of the ACM, 21(4):622-642, October 1974. References, Citations, etc.

Shortcuts: