Reversed resolution in reducing general satisfiability problem

DOI10.1007/S11225-010-9262-6zbMATH Open1202.03027OpenAlexW2039061386MaRDI QIDQ993493FDOQ993493

Authors Adam Kolany 

Publication date 20 September 2010

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11225-010-9262-6

zbMATH Keywords

graph theoryresolutionsatisfiabilitycolorabilitypropositional logicmarriage problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Classical propositional logic (03B05) Hypergraphs (05C65) Mechanization of proofs and logical operations (03B35)

Recommendations

• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 120352
• scientific article; zbMATH DE number 1036758
• Analysis of a new reduction calculus for the satisfiability problem
• A simplified NP-complete satisfiability problem

Cites work

• scientific article; zbMATH DE number 120352 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Davis-Putnam style rules for deciding property S.
• Property S
• Satisfiability on hypergraphs
• The dependence of some logical axioms on disjoint transversals and linked systems

Cited in

(1)

• Theory and Applications of Satisfiability Testing

This page was built for publication: Reversed resolution in reducing general satisfiability problem

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