A new 3-CNF transformation by parallel-serial graphs

DOI10.1016/J.IPL.2008.12.013MaRDI QIDQ976123zbMATH OpenOpenAlexFDO

Authors Uwe Bubeck, Hans Kleine Büning

Publication date 16 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.12.013

zbMATH Keywords

algorithmsconjunctive normal formpropositional logicsatisfiability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Applications of minimal unsatisfiable formulas to polynomially reduction for formulas
• SAT graph-based representation: A new perspective
• scientific article; zbMATH DE number 5575002
• scientific article; zbMATH DE number 2201270
• scientific article; zbMATH DE number 1098495

Cites work

• A structure-preserving clause form translation
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 1470716 (Why is no real title available?)
• scientific article; zbMATH DE number 3325539 (Why is no real title available?)

Cited in

(1)

• SAT graph-based representation: A new perspective

This page was built for publication: A new 3-CNF transformation by parallel-serial graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976123)