tts: a SAT-solver for small, difficult instances

MaRDI QIDQ3604004zbMATH OpenFDO

Authors I. T. A. Spence

Publication date 24 February 2009

zbMATH Keywords

simulated annealingvariable orderingclause memoisation

Mathematics Subject Classification ID

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

Recommendations

• BerkMin: A fast and robust SAT-solver
• scientific article; zbMATH DE number 956858
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• Sgen1, a generator of small but difficult satisfiability benchmarks
• scientific article; zbMATH DE number 5605058

Cited in

(2)

• Producing and verifying extremely large propositional refutations
• tts

This page was built for publication: tts: a SAT-solver for small, difficult instances

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