Improved Static Symmetry Breaking for SAT

DOI10.1007/978-3-319-40970-2_8zbMath1475.68340OpenAlexW2499282942MaRDI QIDQ2818005

Marc Denecker, Jo Devriendt, Maurice Bruynooghe, Bart Bogaerts

Publication date: 5 September 2016

Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/542704

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (10)

On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers ⋮ A Study of Symmetry Breaking Predicates and Model Counting ⋮ Unnamed Item ⋮ Preprocessing of propagation redundant clauses ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ Strong extension-free proof systems ⋮ SAT competition 2020 ⋮ How constraint programming can help chemists to generate benzenoid structures and assess the local aromaticity of benzenoids ⋮ Preprocessing of propagation redundant clauses ⋮ Formula simplification via invariance detection by algebraically indexed types

Uses Software

• GAP
• MiniSat
• nauty
• SymChaff
• Traces
• Shatter
• bliss

Cites Work

• Unnamed Item
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• The intractability of resolution
• Practical graph isomorphism. II.
• Generating effective symmetry-breaking predicates for search problems
• Dynamic Symmetry Breaking by Simulating Zykov Contraction
• Hard examples for resolution
• Symmetry and Satisfiability: An Update
• Theory and Applications of Satisfiability Testing

This page was built for publication: Improved Static Symmetry Breaking for SAT