Woody bledsoe: His life and legacy

AI Magazine

Volumn 17, Issue 1, 1996, Pages 7-20

  Ballantyne, Michael ^a   Boyer, Robert S ^b   Hines, Larry ^c  

^a Software Reengineering for EDS ^*

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c EDS Research and Development

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17444365113     PISSN: 07384602     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (74)

1. Anderson, R., and Bledsoe, W. W. 1970. A Linear Format for Resolution with Merging and a New Technique for Establishing Completeness. Journal of the Association for Computing Machinery 17:525-534.
2. Ballantyne, A. M., and Bledsoe, W. W. 1982. On Generating and Using Examples in Proof Discovery. In Machine Intelligence 10, eds. J. Hayes and D. Michie, 3-39. Chichester, U.K.: Harwood.
3. Ballantyne, A. M., and Bledsoe, W. W. 1977. Automatic Proofs of Theorems in Analysis Using Nonstandard Techniques. Journal of the Association for Computing Machinery 24(3): 353-374.
4. Bing, R. H.; Bledsoe, W. W.; and Mauldin, R. D. 1974. Sets Generated by Rectangles. Pacific Journal of Mathematics 51(1): 27-36.
5. Bisson, C. 1962. Optimization of n-Tuple Memory Matrices Using a Gradient Technique, PRI Internal Memo, Panoramic Research Inc., Palo Alto, California.
6. Bledsoe, W. W. 1995. A Precondition Prover for Analogy. Biosystems 34:225-247.
7. Bledsoe, W. W. 1990. Challenge Problems in Elementary Analysis. Journal of Automated Reasoning 6:341-359.
8. Bledsoe, W. W. 1989. Using Hyper-Resolution on Problem One of LIM+, Technical Report, ATP-91, Automatic Theorem Proving Project, University of Texas at Austin.
9. Bledsoe, W. W. 1986. I Had a Dream: AAAI Presidential Address, 19 August 1985. AI Magazine 7(1): 57-61.
10. Bledsoe, W. W. 1984. Some Automatic Proofs in Analysis. Contemporary Mathematics 29:89-118.
11. Bledsoe, W. W. 1977a. A Maximal Method for Set Variables in Automatic Theorem Proving. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, 501-510. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
12. Bledsoe, W. W. 1977b. Non-Resolution Theorem Proving. Artificial Intelligence 9:1-35.
13. Bledsoe, W. W. 1976. My Personal History. Unpublished manuscript. Manuscript obtained from daughter Pam Bledsoe.
14. Bledsoe, W. W. 1975. A New Method for Proving Certain Presburger Formulas. In Proceedings of the Fourth International Joint Conference on Artificial Intelligence, 15-21. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
15. Bledsoe, W. W. 1971. Splitting and Reduction Heuristics in Automatic Theorem Proving. Artificial Intelligence 2:55-77.
16. Bledsoe, W. W. 1968. Semiautomatic Facial Recognition, Technical Report SRI Project 6693, Stanford Research Institute, Menlo Park, California.
17. Bledsoe, W. W. 1966a. Man-Machine Facial Recognition: Report on a Large-Scale Experiment, Technical Report PRI 22, Panoramic Research, Inc., Palo Alto, California.
18. Bledsoe, W. W. 1966b. Some Results on Multicategory Pattern Recognition. Journal of the Association for Computing Machinery 13(2): 304-316.
19. Bledsoe, W. W. 1964. The Model Method in Facial Recognition, Technical Report PRI 15, Panoramic Research, Inc., Palo Alto, California.
20. Bledsoe, W. W. 1962a. A Basic Limitation on the Speed of Digital Computers. IRE Transactions on Electronic Computers EC-10(3): 530.
21. Bledsoe, W. W. 1962b. An Analysis of Genetic Populations, Technical Report, Panoramic Research, Inc., Palo Alto, California.
22. Bledsoe, W. W. 1962c. The Evolutionary Method in Hill Climbing: Convergence Rates, Technical Report, Panoramic Research, Inc., Palo Alto, California.
23. Bledsoe, W. W. 1961a. Lethally Dependent Genes Using Instant Selection, Technical Report PRI 1, Panoramic Research, Inc., Palo Alto, California.
24. Bledsoe, W. W. 1961b. The Use of Biological Concepts in the Analytical Study of Systems, Technical Report PRI 2, Panoramic Research, Inc., Palo Alto, California. Also 1961. Presented at ORSA-TIMS National Meeting, San Francisco, California, November 10.
25. Bledsoe, W. W. 1961b. The Use of Biological Concepts in the Analytical Study of Systems, Technical Report PRI 2, Panoramic Research, Inc., Palo Alto, California. Also 1961. Presented at ORSA-TIMS National Meeting, San Francisco, California, November 10.
26. Bledsoe, W. W. 1952a. Neighborly Functions. Proceedings of the American Mathematical Society 3(1): 144-145.
27. Bledsoe, W. W. 1952b. Some Aspects of Covering Theory. Proceedings of the American Mathematical Society 3(5): 804-812.
28. Bledsoe, W. W., and Bisson, C. 1962. Improved Memory-Matrices for the N-Tuple Pattern Recognition Method. IRE Transactions on Electronic Computers EC-11:414-415.
29. Bledsoe, W. W., and Browning, I. 1959. Pattern Recognition and Reading by Machine. In Proceedings of the Eastern Joint Computer Conference, 225-232.
30. Bledsoe, W. W., and Bruell, P. 1974. A Man-Machine Theorem-Proving System. Artificial Intelligence 5:51-72.
31. Bledsoe, W. W., and Chan, H. 1965. A ManMachine Facial Recognition System - Some Preliminary Results, Technical Report PRI 19A, Panoramic Research, Inc., Palo Alto, California.
32. Bledsoe, W. W., and Feng, G. 1993. SET-VAR. Journal of Automated Reasoning 11:293-314.
33. Bledsoe, W. W., and Gilbert, E. H. 1967. Automatic Theorem Proof-Checking in Set Theory - A Preliminary Report, Research Report SC-RR-67-525, Sandia Laboratories, Sandia, New Mexico.
34. Bledsoe, W. W., and Hines, L. M. 1980. Variable Elimination and Chaining in a Resolution-Based Prover for Inequalities. In Proceedings of the Fifth Conference on Automated Deduction, 70-87. New York: Springer-Verlag.
35. Bledsoe, W. W., and Hodges, R. 1988. A Survey of Automated Deduction. In Exploring Artificial Intelligence, Survey of Talks from the National Conference on Artificial Intelligence, Seattle, 1987, ed. H. Shrobe, 483-543. San Francisco, Calif.: Morgan Kaufmann.
36. Bledsoe, W. W., and Morse, A. P. 1963. A Topological Measure Construction. Pacific Journal of Mathematics 13(4): 1067-1084.
37. Bledsoe, W. W., and Morse, A. P. 1955. Product Measures. Transactions of the American Mathematical Society 79(1): 173-215.
38. Bledsoe, W. W., and Tyson, M. 1975. The UT Interactive Prover, Technical Report, APT-15, Automatic Theorem Proving Project, University of Texas at Austin.
39. Bledsoe, W. W., and Wilks, C. E. 1972. On Borel Product Measures. Pacific Journal of Mathematics 42(3): 569-579.
40. Bledsoe, W. W.; Boyer, R. S.; and Henneman, W. H. 1971. Computer Proofs of Limit Theorems. Artificial Intelligence 3:27-60.
41. Bledsoe, W. W.; Kunen, K.; and Shostak, R. 1985. Completeness Results for Inequality Provers. AI Journal 27:255-288.
42. Bledsoe, W. W.; Norris, M. J.; and Rose, G. F. 1954. On a Differential Inequality. Proceedings of the American Mathematical Society 5(6): 934-939.
43. Boyer, R. S. 1991. Automated Reasoning: Essays in Honor of Woody Bledsoe. Boston: Kluwer.
44. Boyer, R. S. 1971. Locking: A Restriction of Resolution. Ph.D. diss., Department of Mathematics, University of Texas at Austin.
45. Boyer, A. O., and Boyer, R. S. 1991. A Biographical Sketch of W. W. Bledsoe. In Automated Reasoning: Essays in Honor of Woody Bledsoe, R. S. Boyer, 1-31. Boston: Kluwer.
46. Boyer, R. S., and Moore, J. S. 1988. A Computational Logic Handbook. New York: Academic.
47. Boyer, R. S., and Moore, J. S. 1979. A Computational Logic. New York: Academic.
48. Bremermann, H. J. 1962. Optimization through Evolution and Recombination. In Self-Organizing Systems, eds. M. T. Yovits, Jacobi, and Goldstein. Washington, D.C.: Spartan.
49. Biemermann, H. J., and Anderson, R. W. 1991. How the Brain Adjusts Synapses - Maybe. In Automated Reasoning: Essays in Honor of Woody Bledsoe, R. S. Boyer, 119-147. Boston: Kluwer.
50. Edelman, G. M. 1987. Neural Darwinism. New York: Basic.
51. Gillman, L. 1996. Personal Communication with Authors, January 1996, Austin, Texas.
52. Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, Mass.: Addison-Wesley.
53. Good, D. I. 1985. Mechanical Proofs about Computer Programs. In Mathematical Logic and Programming Languages, eds. C. A. R. Hoare and J. C. Shepherdson, 55-75. New York: Prentice-Hall.
54. Good, D. I.; London, R. L.; and Bledsoe, W. W. 1975. An Interactive Verification System. IEEE Transactions on Software Engineering 1:59-67.
55. Hart, P. 1996. Personal Communication with Authors, January 1996, Palo Alto, California.
56. Hines, L. M. 1994. STR+VE and Integers. In Proceedings of the Twelfth International Conference on Automated Deduction, 416-430. New York: Springer-Verlag.
57. Hines, L. M. 1992. Completeness of a Prover for Dense Linear Order. Journal of Automated Reasoning 8:45-75.
58. Hines, L. M. 1990. STR+VE-Subset: The STR+VE-Based Subset Prover. In Proceedings of the Tenth International Conference on Automated Deduction, 193-206. New York: Springer-Verlag.
59. Hines, L. M., and Bledsoe, W. W. 1990. The Str+ve Prover, Technical Report, ATP-94, Automatic Theorem Proving Project, University of Texas at Austin.
60. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor, Mich.: University of Michigan Press.
61. Huet, G. 1973. A Mechanization of Type Theory. In Proceedings of the Third International Joint Conference on Artificial Intelligence, 139-146. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
62. Knuth, D. E., and Bendix, P. B. 1970. Simple Word Problems in Universal Algebras. In Computational Problems in Abstract Algebras, ed. J. Leech, 263-297. Oxford, U.K.: Pergamon.
63. Lankford, D. S. 1975a. Canonical Inference, Technical Report, ATP-32, Automatic Theorem Proving Project, University of Texas at Austin.
64. Lankford, D. S. 1975b. Complete Sets of Reductions for Computational Logic, Technical Report, ATP-21, Automatic Theorem Proving Project, University of Texas at Austin.
65. Lankford, D. S., and Ballantyne, A. M. 1977. Decision Procedures for Simple Equational Theories with Commutative-Associative Axioms: Complete Sets of Commutative-Associative Reductions, Technical Report, ATP-39, Automatic Theorem Proving Project, University of Texas at Austin.
66. Lenat, D. 1996. Personal Communication with Authors, January 1996, Austin, Texas.
67. Morris, J. B. 1969. E-Resolution: Extension of Resolution to Include the Equality Relation. In Proceedings of the First International Joint Conference on Artificial Intelligence, 287-294. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
68. Morse, A. P. 1965. A Theory of Sets. New York: Academic.
69. Robinson, J. A. 1965. A Machine-Oriented Logic Based on the Resolution Principle. Journal of the Association for Computing Machinery 12:23-41.
70. Slagle, J. 1974. Automated Theorem Proving with Simplifies, Commutativity, Associativity. Journal of the Association for Computing Machinery 21:622-642.
71. Warren, D. H. D. 1987. Implementing PROLOG - Compiling Predicate Logic Programs, Technical Report, 39(40), Department of Artificial Intelligence, University of Edinburgh.
72. Wos, L., and McCune, W. 1992. The Application of Automated Reasoning to Questions in Mathematics and Logic. Annals of Mathematics and Artificial Intelligence 5:321-370.
73. Wos, L.; Robinson, G.; and Carson, D. F. 1965. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving. Journal of the Association for Computing Machinery 12:276-310.
74. Wos, L.; Robinson, G.; Carson, D.; and Shalla, L. 1967. The Concept of Demodulation in Theorem Proving. Journal of the Association for Computing Machinery 14:698-709.