SyMT : finding symmetries in SMT formulas Work in progress ∗

@inproceedings{Areces2013SyMTF,
  title={SyMT : finding symmetries in SMT formulas Work in progress ∗},
  author={Carlos Areces and David D{\'e}harbe and Pascal Fontaine and Ezequiel Orbe},
  year={2013}
}
The QF UF category of the SMT-LIB test set contains many formulas with symmetries, and breaking these symmetries results in an important speedup [8]. This paper presents SyMT, a tool to find and report symmetries in SMT formulas. SyMT is based on the reduction of the problem of detecting symmetries in formulas to finding automorphisms in a graph representation of these formulas. The output of SyMT may be used to improve SMT formulas to enforce the SMT solver to examine only one assignment out… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…