Abstract
Resolution is a sound and complete algorithm for propositional logic: a formula in clausal form is unsatisfiable if and only if the algorithm reports that it is unsatisfiable. For propositional logic, the algorithm is also a decision procedure for unsatisfiability because it is guaranteed to terminate. When generalized to first-order logic, resolution is still sound and complete, but it is not a decision procedure because the algorithm may not terminate.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Fitting. First-Order Logic and Automated Theorem Proving (Second Edition). Springer, 1996.
J.W. Lloyd. Foundations of Logic Programming (Second Edition). Springer, Berlin, 1987.
D.W. Loveland. Automated Theorem Proving: A Logical Basis. North-Holland, Amsterdam, 1978.
A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4:258–282, 1982.
J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12:23–41, 1965.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London
About this chapter
Cite this chapter
Ben-Ari, M. (2012). First-Order Logic: Resolution. In: Mathematical Logic for Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4129-7_10
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4129-7_10
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4128-0
Online ISBN: 978-1-4471-4129-7
eBook Packages: Computer ScienceComputer Science (R0)