Pages that link to "Item:Q2818005"
From MaRDI portal
The following pages link to Improved Static Symmetry Breaking for SAT (Q2818005):
Displaying 17 items.
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- SAT competition 2020 (Q2060693) (← links)
- How constraint programming can help chemists to generate benzenoid structures and assess the local aromaticity of benzenoids (Q2079271) (← links)
- Preprocessing of propagation redundant clauses (Q2104502) (← links)
- Formula simplification via invariance detection by algebraically indexed types (Q2104529) (← links)
- Efficient symmetry breaking for SAT-based minimum DFA inference (Q2278273) (← links)
- Strong extension-free proof systems (Q2303251) (← links)
- CDCLSym: introducing effective symmetry breaking in SAT solving (Q2324209) (← links)
- Reducing symmetries to generate easier SAT instances (Q2848064) (← links)
- (Q5020979) (← links)
- A Study of Symmetry Breaking Predicates and Model Counting (Q5039506) (← links)
- Symmetry Breaking for Maximum Satisfiability (Q5505539) (← links)
- An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
- Preprocessing of propagation redundant clauses (Q6053844) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
- SAT modulo symmetries for graph generation and enumeration (Q6610196) (← links)
- Automated mathematical discovery and verification: minimizing pentagons in the plane (Q6648153) (← links)