BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.
Cowen, Robert ; Wyatt, Katherine
Notre Dame J. Formal Logic, Tome 34 (1993) no. 4, p. 602-606 / Harvested from Project Euclid
Publié le : 1993-09-14
Classification:  03B35,  03B10,  68Q25
@article{1093633909,
     author = {Cowen, Robert and Wyatt, Katherine},
     title = {BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.},
     journal = {Notre Dame J. Formal Logic},
     volume = {34},
     number = {4},
     year = {1993},
     pages = { 602-606},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1093633909}
}
Cowen, Robert; Wyatt, Katherine. BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.. Notre Dame J. Formal Logic, Tome 34 (1993) no. 4, pp.  602-606. http://gdmltest.u-ga.fr/item/1093633909/