Short proofs of the pigeonhole formulas based on the connection method

DOI10.1007/BF00244489zbMath0702.68091MaRDI QIDQ915494

Wolfgang Bibel

Publication date: 1990

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

resolutionautomated theorem provingproof complexityconnection method

Mathematics Subject Classification ID

Related Items

Tractability through symmetries in propositional calculus, Clause trees: A tool for understanding and implementing resolution in automated reasoning, Simplification in a satisfiability checker for VLSI applications