“One sugar cube, please” or selection strategies in the Buchberger algorithm
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
A dynamic algorithm for Gröbner basis computation
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Monomial representations for Gröbner bases computations
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Random CNF's are Hard for the Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algebraic simplification a guide for the perplexed
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Homogenization and the polynomial calculus
Computational Complexity
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
A simplifier for propositional formulas with many binary clauses
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
A pommaret division algorithm for computing Grobner bases in boolean rings
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
On computation of Boolean involutive bases
Programming and Computing Software
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
Automated reencoding of boolean formulas
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Proof logging for computer algebra based SMT solving
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
This paper presents a CNF SAT-formulae transformation technique employing Gröbner bases as a means to analyze the problem structure. Gröbner-bases have been applied in the past for SAT; however, their use was primarily restricted to analyzing entire problems for proof-refutation. In contrast, this technique analyzes limited subsets of problems, and uses the derived Gröbner bases to yield new constraint-information. This information is then used to reduce problemstructure, provide additional information about the problem itself, or aid other preprocessing techniques. Contrary to the precepts of contemporary techniques, the transformation often increases the problem size. However, experimental results demonstrate that our approach often improves SAT-search efficiency in a number of areas, including: solve time, conflicts, number of decisions, etc.