Boolean Gröbner bases in SAT solving

DOI10.1145/2016567.2016596zbMATH Open1305.68377OpenAlexW2157151012MaRDI QIDQ5175309

Christoph Zengler, Wolfgang Küchlin

Publication date: 20 February 2015

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2016567.2016596

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases

This page was built for publication: Boolean Gröbner bases in SAT solving

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