Isomorph-free model enumeration: a new method for checking relational specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Journal of Automated Reasoning
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
FINDER: Finite Domain Enumerator - System Description
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
The eXtended Least Number Heuristic
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Automatic generation of some results in finite algebra
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
SEM: a system for enumerating models
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
An Isomorph-Free SEM-Like Enumeration of Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Computer search for counterexamples to wilkie's identity
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Computer Search for Large Sets of Idempotent Quasigroups
Computer Mathematics
Exploiting symmetry in SMT problems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
MACE4 and SEM: a comparison of finite model generators
Automated Reasoning and Mathematics
| Hi-index | 0.00 |
We propose a general-purpose technique, called DASH (Decision Assignment Scheme Heuristic), to eliminate isomorphic subspaces when generating finite models. Like LNH, DASH is based on inherent isomorphism in first order clauses on finite domains. Unlike other methods, DASH can completely eliminate isomorphism during the search. Therefore, DASH can generate all the models none of which are isomorphic. And DASH is an efficient technique for finite model enumeration. The main idea is to cut the branch of the search tree which is isomorphic to a branch that has been searched. We present a new method to describe the class of isomorphic branches. We implemented this technique by modifying SEM1.7B, and the new tool is called SEMD. This technique proves to be very efficient on typical problems like the generation of finite groups, rings and quasigroups. The experiments show that SEMD is much faster than SEM on many problems, especially when generating all the models and when there is no model. SEMD can generate all the non-isomorphic models with little extra cost, while other tools like MACE4 will spend more time.