scientific article; zbMATH DE number 6131661

zbMath1258.68137MaRDI QIDQ4904223

Karem A. Sakallah, João P. Marques-Silva

Publication date: 28 January 2013

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

CDCL(SAT)Boolean satisfiability decision problemconflict-driven clause learning SAT solvers

Mathematics Subject Classification ID

Computational learning theory (68Q32) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Parameterized complexity classes beyond para-NP ⋮ Deciding floating-point logic with abstract conflict driven clause learning

Uses Software

• MiniSat
• SATO
• BerkMin
• Velev SAT Benchmarks

This page was built for publication: