A restriction of factoring in binary resolution

  • Arkady Rabinov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 310)


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.

Key words and phrases

Factoring binary resolution theorem proving 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Genesereth and N. Nilsson, Logical Foundations of Artificial Intelligence, Los Altos, CA, Morgan Kaufmann, 1987.Google Scholar
  2. [2]
    S. Maslov, Proof-search Strategies for Methods of the Resolution Type, Machine Intelligence 6, 1971.Google Scholar
  3. [3]
    J. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the Association for Computing Machinery 12, 1965.Google Scholar
  4. [4]
    V. Sharonov, Strategy of defactorization in resolution method (Russian) Issledovania po Prikladnoi Matematike, Kazan, USSR, 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Arkady Rabinov
    • 1
  1. 1.Department of Computer ScienceStanford UniversityStanford

Personalised recommendations