A Conjecture for ATP Research

2024/03/15 by Bibel, Wolfgang
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2403.10334

Abstract

This note generalizes factorization for formulas with multiplicities and conjectures that the connection method along with this feature is computationally as powerful as resolution, also seen from a complexity point of view.

Related

• A factorization homology primer
• A simple way to reduce factorization problems to SAT
• A proof of factorization formula for critical percolation
• Note on Integer Factoring Methods IV
• Algebrization