Reproducible efficient parallel SAT solving

DOI10.1007/978-3-030-51825-7_10OpenAlexW3039437247MaRDI QIDQ2661341

Hidetomo Nabeshima, Katsumi Inoue

Publication date: 7 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Uses Software

• ManySAT
• PSATO
• Plingeling
• Treengeling
• PaInleSS
• Lingeling
• PaMira
• PaSAT

This page was built for publication: Reproducible efficient parallel SAT solving