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:
“Had I been less resolved to work, I would perhaps had made an effort to begin immediately. But since my resolution was formal and before twenty four hours, in the empty slots of the next day where everything fit so nicely because I was not yet there, it was better not to choose a night at which I was not well-disposed for a debut to which the following days proved, alas, no more propitious.... Unfortunately, the following day was not the exterior and vast day which I had feverishly awaited.”
—Marcel Proust (1871–1922)