A faster clause-shortening algorithm for SAT with no restriction on clause length

MaRDI QIDQ3429016zbMATH OpenFDO

Authors E. Ya. Dantsin, Alexander Wolpert

Publication date 30 March 2007

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Recommendations

• Theory and Applications of Satisfiability Testing
• Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
• Algorithms – ESA 2005
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 1303594

Cited in

(5)

• Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
• An Improved SAT Algorithm in Terms of Formula Length
• Theory and Applications of Satisfiability Testing
• On Some Aspects of Mixed Horn Formulas
• Theory and Applications of Satisfiability Testing

This page was built for publication: A faster clause-shortening algorithm for SAT with no restriction on clause length

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