BREAKUP: A preprocessing algorithm for satisfiability testing of CNF formulas

DOI10.1305/NDJFL/1093633909zbMath0795.03018OpenAlexW2080557554MaRDI QIDQ1317978

Katherine Wyatt, Robert H. Cowen

Publication date: 1 September 1994

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093633909

zbMATH Keywords

CNF formulasnumber of variablesnumber of clausessatisfiability testing algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35)

Related Items (1)

Partition-based logical reasoning for first-order and propositional theories

This page was built for publication: BREAKUP: A preprocessing algorithm for satisfiability testing of CNF formulas