Reversed resolution in reducing general satisfiability problem

DOI10.1007/S11225-010-9262-6zbMath1202.03027OpenAlexW2039061386MaRDI QIDQ993493

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

propositional logicgraph theorycolorabilityresolutionsatisfiabilitymarriage problem

Mathematics Subject Classification ID

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

Cites Work

• Satisfiability on hypergraphs
• The dependence of some logical axioms on disjoint transversals and linked systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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