<div class="description">
<dl><dd>"NPS-52-82-002"--Cover</dd>
<dd>Cover title</dd>
<dd>"March 1982"--Cover</dd>
<dd>"Prepared for: Naval Postgraduate School, Monterey, California 93940."</dd>
<dd>Includes bibliographical references (p. 25-26)</dd>
<dd>Technical report; 1982</dd>
<dd>In this paper we pose and begin to explore a deductive problem more general than that of finding a proof that a given goal formula logically follows from a given set of hypotheses. The problem is most simply stated in the propositional calculus: given a goal A and hypothesis H we wish to find a formula P, called a precondition, such that A logically follows from both P and H. A precondition provides any additional conditions under which A can be shown to follow from H. A slightly more complex definition of preconditions in a first-order theory is given and used throughout the paper. A formal system based on natural deduction is presented in which preconditions can be derived. A number of examples are then given which show how derived preconditions are used in a program synthesis method we are developing. These uses include theorem proving, formula simplification, simple code generation, the completion of partial specifications for a subalgorithm, and other tasks of a deductive nature. (Author)</dd>
<dd>ck/ 4/15/09</dd></dl><br>Subjects: Automatic theorem proving</div>
<div class="fn value">
Smith, Douglas R.</div>
Internet Archive identifier