Short proofs of the pigeonhole formulas based on the connection method

From MaRDI portal

Revision as of 17:09, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:915494

Jump to:navigation, search

DOI10.1007/BF00244489zbMath0702.68091MaRDI QIDQ915494

Wolfgang Bibel

Publication date: 1990

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

zbMATH Keywords

resolution automated theorem proving proof complexity connection method

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (3)

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

This page was built for publication: Short proofs of the pigeonhole formulas based on the connection method

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:915494&oldid=12879690"

Pages with script errors