Boolean Rings for Intersection-Based Satisfiability

DOI10.1007/11916277_33MaRDI QIDQ5387914zbMATH OpenOpenAlexFDO

Authors Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss

Publication date 27 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11916277_33

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35) Logical aspects of Boolean algebras (03G05) Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1114006
• Boolean Gröbner bases in SAT solving
• Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
• A new method for the Boolean ring based theorem proving
• Boolean Gröbner bases. Theory, algorithms and applications

Cited in

(4)

• Linear strategy for Boolean ring based theorem proving
• Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
• scientific article; zbMATH DE number 1114006 (Why is no real title available?)
• Formula normalizations in verification

This page was built for publication: Boolean Rings for Intersection-Based Satisfiability

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