Abstract
Since the unconstrained use of factoring can lead to a growing number of irrelevant and redundant clauses, it is important to consider the strategies restricting the factoring in binary resolution. We propose in this paper FE-resolution — a strategy restricting factoring in binary resolution to the literals that are equivalent in the sense that each of them is the result of renaming the variables in any other. We show that FE-resolution is complete.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Genesereth and N. Nilsson, Logical Foundations of Artificial Intelligence, Los Altos, CA, Morgan Kaufmann, 1987.
S. Maslov, Proof-search Strategies for Methods of the Resolution Type, Machine Intelligence 6, 1971.
J. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the Association for Computing Machinery 12, 1965.
V. Sharonov, Strategy of defactorization in resolution method (Russian) Issledovania po Prikladnoi Matematike, Kazan, USSR, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rabinov, A. (1988). A restriction of factoring in binary resolution. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012859
Download citation
DOI: https://doi.org/10.1007/BFb0012859
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19343-2
Online ISBN: 978-3-540-39216-3
eBook Packages: Springer Book Archive