A Gröbner Basis Approach to CNF-Formulae Preprocessing

DOI10.1007/978-3-540-71209-1_48zbMath1186.68576OpenAlexW2040865792MaRDI QIDQ5758133

Christopher Condrat, Priyank Kalla

Publication date: 3 September 2007

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71209-1_48

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Obtaining and solving systems of equations in key variables only for the small variants of AES ⋮ On computation of Boolean involutive bases ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases ⋮ Satisfiability Procedures for Combination of Theories Sharing Integer Offsets ⋮ On conversions from CNF to ANF

Uses Software

• Chaff
• BerkMin
• NiVER

This page was built for publication: A Gröbner Basis Approach to CNF-Formulae Preprocessing