Notre Dame Journal of Formal Logic

BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.

Robert Cowen and Katherine Wyatt

Full-text: Open access

Article information

Source
Notre Dame J. Formal Logic Volume 34, Number 4 (1993), 602-606.

Dates
First available in Project Euclid: 27 August 2004

Permanent link to this document
http://projecteuclid.org/euclid.ndjfl/1093633909

Zentralblatt MATH identifier
0795.03018

Mathematical Reviews number (MathSciNet)
MR1256417

Digital Object Identifier
doi:10.1305/ndjfl/1093633909

Subjects
Primary: 03B35: Mechanization of proofs and logical operations [See also 68T15]
Secondary: 03B10: Classical first-order logic 68Q25: Analysis of algorithms and problem complexity [See also 68W40]

Citation

Cowen, Robert; Wyatt, Katherine. BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas. Notre Dame J. Formal Logic 34 (1993), no. 4, 602--606. doi:10.1305/ndjfl/1093633909. http://projecteuclid.org/euclid.ndjfl/1093633909.


Export citation