A Gröbner Basis Approach to CNF-Formulae Preprocessing

DOI10.1007/978-3-540-71209-1_48MaRDI QIDQ5758133zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Boolean Gröbner bases in SAT solving
• Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 7300405

Cited in

(10)

• On computation of Boolean involutive bases
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• On conversions from CNF to ANF
• SAT graph-based representation: A new perspective
• Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
• Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
• scientific article; zbMATH DE number 1507246 (Why is no real title available?)
• Boolean Gröbner bases in SAT solving
• Obtaining and solving systems of equations in key variables only for the small variants of AES
• Gröbner bases for Boolean function minimization

Describes a project that uses

Uses Software

• Chaff
• BerkMin
• NiVER

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

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