scientific article; zbMATH DE number 2201270

MaRDI QIDQ5313698zbMATH OpenFDO

Authors Ji'an Wang, Daoyun Xu

Publication date 1 September 2005

zbMATH Keywords

reduction algorithmconjunctive normal formminimal unsatisfiable formulas

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)

Recommendations

• Applications of minimal unsatisfiable formulas to polynomially reduction for formulas
• An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
• Two tractable subclasses of minimal unsatisfiable formulas
• SAT-Problems and Reductions with Respect to the Number of Variables
• Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.

Cited in

(2)

• A new 3-CNF transformation by parallel-serial graphs
• Applications of minimal unsatisfiable formulas to polynomially reduction for formulas

This page was built for publication:

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