Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68202DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325880FDOQ5325880

Authors: Oliver Kullmann 

Publication date: 24 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95238

Recommendations

• Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
• How Many Conflicts Does It Need to Be Unsatisfiable?
• Unsatisfiable CNF formulas contain many conflicts

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• New width parameters for SAT and \#SAT
• Are hitting formulas hard for resolution?
• How Many Conflicts Does It Need to Be Unsatisfiable?
• Irreducible subcube partitions
• Transforming quantified Boolean formulas using biclique covers

This page was built for publication: Theory and Applications of Satisfiability Testing

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