Results 1 
4 of
4
SET VARIABLES
"... ABSTRACT: A procedure is described that gives values to set variables in automatic theorem proving. The result is that a theorem is thereby reduced to first order logic, which is often much easier to prove. This procedure handles a part of higher order logic, a small but important part. It is not as ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ABSTRACT: A procedure is described that gives values to set variables in automatic theorem proving. The result is that a theorem is thereby reduced to first order logic, which is often much easier to prove. This procedure handles a part of higher order logic, a small but important part. It is not as general as the methods of Huet, Andrews, Pietrzykowski, and Haynes and Henschen, but it seems to be much faster when it applies. It is more in the spirit of J.L. Darlington's FMatching. This procedure is not domain specific: results have been obtained In intermediate analysis (the intermediate value theorem), topology, logic, and program verification (finding internal assertions). This method is a "maximal method" in that a largest (or maximal) set is usually produced if there is one. A preliminary version has been programmed for the computer and run to prove several theorems.
Woody Bledsoe His Life and Legacy
"... Lou Gehrig’s disease. Woody was one of the founders of AI, making early contributions in pattern recognition and automated reasoning. He continued to make significant contributions to AI throughout his long career. His legacy consists not only of his scientific work but also of several generations o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Lou Gehrig’s disease. Woody was one of the founders of AI, making early contributions in pattern recognition and automated reasoning. He continued to make significant contributions to AI throughout his long career. His legacy consists not only of his scientific work but also of several generations of scientists who learned from Woody the joy of scientific research and the way to go about it. Woody’s enthusiasm, his perpetual sense of optimism, his cando attitude, and his deep sense of duty to humanity offered those who knew him the hope and comfort that truly good and great men do exist.
In Memoriam Woodrow Wilson Bledsoe
"... by mathematics and recalls spending "hours just roaming around, sometimes working mathematics problems mentally" (Bledsoe 1976). When Woody was 12, his father died. It was a devastating blow both emotionally and financially. As Woody recalled, "We were poor before, but after papa died in January 19 ..."
Abstract
 Add to MetaCart
by mathematics and recalls spending "hours just roaming around, sometimes working mathematics problems mentally" (Bledsoe 1976). When Woody was 12, his father died. It was a devastating blow both emotionally and financially. As Woody recalled, "We were poor before, but after papa died in January 1934, things got worse" (Bledsoe 1976). He and the rest of his brothers and sisters worked dreary 10hour days to make ends meet. Woody ran away from home at 16. He found work in north Texas driving a tractor all night. After a month, he hopped a freight train to Colorado to visit his brother, who was working in a Civilian Conservation Corps camp. After a few weeks, he made his way to the south Texas town of Calliham, where he lived with some friends for a year. He graduated from high school during that year (1939). Woody then returned to live with his mother, who had moved to Norman, Oklahoma. He took a job as a dishwasher, working 12hour days 7 days a week. He enrolled at the University o
Using Message Passing Instead of the GOTO Construct
, 1978
"... This paper advocates a programming methodology using message passing. Efficient programs are derived for fast exponentiation, merging ordered sequences, and path existence determination in a directed graph. The problems have been proposed by John Reynolds as interesting ones to investigate because t ..."
Abstract
 Add to MetaCart
This paper advocates a programming methodology using message passing. Efficient programs are derived for fast exponentiation, merging ordered sequences, and path existence determination in a directed graph. The problems have been proposed by John Reynolds as interesting ones to investigate because they. illustrate significant issues in programming. The methodology advocated here is directed toward the production of programs that are intended to execute efficiently in a computing environment with many processors. The absence of the COTO construct does not seem to be constricting in any respect in the development of efficient programs using the programming methodology advocated here. The programming problems arising from use of the GOTO construct have become well known over the last decade. However, removal of the construct from traditional programming languages has been found by many to be constricting and to result in inefficient programs. A number of proposals have been advanced to allow the construct in a restricted way e.g. Knuth: 1974 and Reynolds: 19771.