Reducing symmetries to generate easier SAT instances

zbMATH Open1272.68376MaRDI QIDQ2848064FDOQ2848064

Authors: Jian Zhang, Zhuo Huang 

Publication date: 25 September 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105050784

Recommendations

• Computer Aided Verification
• Improved static symmetry breaking for SAT
• Speeding up SAT solver by exploring CNF symmetries: Revisited
• Exploiting symmetry in SMT problems
• Symmetry Breaking for Maximum Satisfiability
• Exploiting symmetries within constraint satisfaction search
• CDCLSym: introducing effective symmetry breaking in SAT solving
• SAT-Problems and Reductions with Respect to the Number of Variables
• When symmetries are not enough: a hierarchy of hard constraint satisfaction problems

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Predicting and detecting symmetries in FOL finite model search
• Kodkod: A Relational Model Finder
• Title not available (Why is that?)
• Symmetry avoidance in MACE-style finite model finding

This page was built for publication: Reducing symmetries to generate easier SAT instances

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