The intractability of resolution (complexity)

Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution

Journal of the ACM (JACM)

Proving Unsatisfiability of CNFs Locally

Journal of Automated Reasoning

Pebblings, edgings, and equational logic

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Formula dissection: A parallel algorithm for constraint satisfaction

Computers & Mathematics with Applications