Boolean Gröbner bases in SAT solving

Authors:
Christoph Zengler;Wolfgang Küchlin
Affiliations:
University of Tübingen, Tübingen, Germany;University of Tübingen, Tübingen, Germany
Venue:
ACM Communications in Computer Algebra
Year:
2011

Citing 2
Cited 0

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
Extending clause learning of SAT solvers with Boolean Gröbner bases

CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We want to incorporate the reasoning power of Boolean Gröbner bases into modern SAT solvers. There are many starting points where to plug in the Gröbner bases engine in the SAT solving process. As a first step we chose the learning part where new consequences (lemmas) of the original formula are deduced. This paper shows first promising results, also published at the CASC 2010 in Armenia [1].