Symmetry breaking for pseudo-Boolean formulas

DOI10.1145/1227161.1278375MaRDI QIDQ5269268zbMATH OpenOpenAlexFDO

Authors Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah

Publication date 15 June 2017

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1227161.1278375

zbMATH Keywords

graph automorphism

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean programming (90C09)

Recommendations

• Recent Advances in Constraints
• Symmetry Breaking for Maximum Satisfiability
• Improved static symmetry breaking for SAT
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• Symmetry breaking revisited

Cited in

(3)

• Symmetries of quantified Boolean formulas
• Recent Advances in Constraints
• Dynamic symmetry-breaking for Boolean satisfiability

This page was built for publication: Symmetry breaking for pseudo-Boolean formulas

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