Resolution (logic)
In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a refutation theorem-proving technique for sentences in propositional logic and first-order logic. In other words, iteratively applying the resolution rule in a suitable way allows for telling whether a propositional formula is satisfiable and for proving that a first-order formula is unsatisfiable; this method may prove the satisfiability of a first-order satisfiable formula, but not always, as it is the case for all methods for first-order logic (see Gödel's incompleteness theorems and Halting problem). Resolution was introduced by John Alan Robinson in 1965.
The clause produced by a resolution rule is sometimes called a resolvent.
Read more about Resolution (logic): A Simple Example, Resolution in First Order Logic, Implementations, See Also
Famous quotes containing the word resolution:
“We have been here over forty years, a longer period than the children of Israel wandered through the wilderness, coming to this Capitol pleading for this recognition of the principle that the Government derives its just powers from the consent of the governed. Mr. Chairman, we ask that you report our resolution favorably if you can but unfavorably if you must; that you report one way or the other, so that the Senate may have the chance to consider it.”
—Anna Howard Shaw (1847–1919)