Answer: 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 word, interactively
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.
Post a Comment