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

DOI10.1007/978-3-642-15274-0_26zbMath1290.68141OpenAlexW1579470922MaRDI QIDQ3587716

Wolfgang Küchlin, Christoph Zengler

Publication date: 10 September 2010

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15274-0_26

zbMATH Keywords

MiniSATRedlog

Mathematics Subject Classification ID

Computational learning theory (68Q32) Symbolic computation and algebraic computation (68W30)

Related Items (1)

On conversions from CNF to ANF

Uses Software

• MiniSat
• REDLOG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New developments in the theory of Gröbner bases and applications to formal verification
• Parametric quantified SAT solving
• Efficiently Calculating Evolutionary Tree Measures Using SAT
• Theory and Applications of Satisfiability Testing
• Boolean Rings for Intersection-Based Satisfiability
• A machine program for theorem-proving
• A Gröbner Basis Approach to CNF-Formulae Preprocessing
• The Theory of Representation for Boolean Algebras
• Bounded model checking using satisfiability solving

This page was built for publication: Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases