Logic in computer science compelling analysis of what can be called a mechanical procedure and Kurt Gödel asserted that he found Turing's analysis "perfect." In addition some other major areas of theoretical overlap between logic and computer science are: One of the first applications to use the term Artificial Intelligence was the Logic Theorist system developed by Allen Newell, J.C. Shaw, and Herbert Simon in 1956. One of the things that a logician does is to take a set of statements in logic and deduce the conclusions (additional statements) that must be true by the laws of logic. For example, If given a logical
Resolution (logic) premises hold, then the conclusion formula_19 is true. Resolution rule can be generalized to first-order logic to: where formula_21 is a most general unifier of formula_22 and formula_23 and formula_24 and formula_25 have no common variables. The clauses formula_26 and formula_27 can apply this rule with formula_28 as unifier. Here x is a variable and b is a constant. Here we see that In first order logic, resolution condenses the traditional syllogisms of logical inference down to a single rule. To understand how resolution works, consider the following example syllogism of term logic: Or, more generally: To recast the reasoning