Journal of the ACM (JACM)
Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Shatter: efficient symmetry-breaking for boolean satisfiability
Proceedings of the 40th annual Design Automation Conference
Structural Detection of Symmetries in Boolean Functions
ICCD '03 Proceedings of the 21st International Conference on Computer Design
Efficient symmetry breaking for boolean satisfiability
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Solving difficult instances of Boolean satisfiability in the presence of symmetry
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Computing in Science and Engineering
Skewed mirror symmetry detection from a 2D sketch of a 3D model
GRAPHITE '05 Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Integration of supercubing and learning in a SAT solver
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Post-placement rewiring and rebuffering by exhaustive search for functional symmetries
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Efficient Symmetry Breaking for Boolean Satisfiability
IEEE Transactions on Computers
Building a better Boolean matcher and symmetry detector
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Postplacement rewiring by exhaustive search for functional symmetries
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
Faster symmetry discovery using sparsity of symmetries
Proceedings of the 45th annual Design Automation Conference
Efficiently Solving Problems Where the Solutions Form a Group
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Symmetry Breaking for Maximum Satisfiability
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automatic Symmetry Detection for Promela
Journal of Automated Reasoning
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Breaking instance-independent symmetries in exact graph coloring
Journal of Artificial Intelligence Research
On implementing symmetry detection
Constraints
Logical and physical restructuring of fan-in trees
Proceedings of the 19th international symposium on Physical design
Filtering for subgraph isomorphism
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A novel approach for detecting symmetries in CSP models
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
On the constructive orbit problem
Annals of Mathematics and Artificial Intelligence
Generic and automatic address configuration for data center networks
Proceedings of the ACM SIGCOMM 2010 conference
Symmetry-breaking answer set solving
AI Communications - Answer Set Programming
Isomorphism Testing via Polynomial-Time Graph Extensions
Journal of Mathematical Modelling and Algorithms
Automatic symmetry detection for model checking using computational group theory
FM'05 Proceedings of the 2005 international conference on Formal Methods
Symmetry and satisfiability: an update
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Exact and approximate strategies for symmetry reduction in model checking
FM'06 Proceedings of the 14th international conference on Formal Methods
A computational group theoretic symmetry reduction package for the SPIN model checker
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Symmetry reduction for b by permutation flooding
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
DAC: generic and automatic address configuration for data center networks
IEEE/ACM Transactions on Networking (TON)
Directed test generation for validation of multicore architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special section on verification challenges in the concurrent world
Conflict anticipation in the search for graph automorphisms
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Solving large Steiner Triple Covering Problems
Operations Research Letters
Using symmetry to optimize over the sherali-adams relaxation
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Practical graph isomorphism, II
Journal of Symbolic Computation
Hi-index | 0.00 |
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed artifact, and thus are likely to possess much inherent symmetry and sparsity. Previous work[4] has shown that exploiting symmetries results in vastly reduced SAT solver run times, often with the search for the symmetries themselves dominating the total SAT solving time. Our contribution is twofold. First, we dissect the algorithms behind the venerable NAUTY[9] package, particularly the partition refinement procedure responsible for the majority of search space pruning as well as the majority of run time overhead. Second, we present a new symmetry-detection tool, SAUCY, which outperforms NAUTY by several orders of magnitude on the large, structured CNF formulas generated from typical EDA problems.