Incremental inprocessing in SAT solving

DOI10.1007/978-3-030-24258-9_9zbMath1441.68224OpenAlexW2956139423MaRDI QIDQ2181926

Katalin Fazekas, Armin Biere, Christoph Scholl

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-24258-9_9

Mathematics Subject Classification ID

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

Related Items (7)

Mining definitions in Kissat with Kittens ⋮ Truth Assignments as Conditional Autarkies ⋮ On preprocessing for weighted MaxSAT ⋮ Clause vivification by unit propagation in CDCL SAT solvers ⋮ SAT competition 2020 ⋮ Covered clauses are not propagation redundant ⋮ XOR local search for Boolean Brent equations

This page was built for publication: Incremental inprocessing in SAT solving