A powerful technique to eliminate isomorphism in finite model search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4130 LNAI, Issue , 2006, Pages 318-331

  Jia, Xiangxue ^a,b   Zhang, Jian ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

DASH; Isomorphism; LNH; Scheme; Symmetry breaking

Indexed keywords

MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

FINITE MODEL ENUMERATION; ISOMORPHIC SUBSPACES; ISOMORPHISM; SEARCH TREE;

HEURISTIC METHODS;

EID: 33749558621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_29     Document Type: Conference Paper

References (22)

1. Jackson D., Jha S., and Damon C.A. Isomorph-free model enumeration: A new method for checking relational specifications. ACM Transactions on Programming Languages and Systems, 20(2):302-343, 1998.
2. Boy de la Tour T. and Countcham P. An isomorph-free SEM-like enumeration of models. Electr. Notes Theor. Comput, Sci., 125(2):91-113, 2005.
3. Moskewicz M et al. Chaff: Engineering an efficient SAT solver. In Proc. 39th Design Automation Conference, pages 530-535, 2001.
4. Audemard G. and Henocque L. The extended least number heuristic. In Proc. of the 1st Int'l Joint Conference on Automated Reasoning, pages 427-442, 2001.
5. Sutcliffe G. and Suttner C.B. The TPTP problem library - CNF release v1.2.1. Journal of Automated Reasoning, 21 (2): 177-203, 1998.
6. Zhang H. An efficient propositional prover. In Proc. 14th Int'l Conf. on Automated Deduction (CADE-14), pages 272-275, 1997.
7. Gent I. and Smith B. Symmetry breaking in constraint programming. In Proc. ECAP'00, pages 599-603, 2000.
8. Gent I., Harvey W., Kelsey T., and Linton S. Generic SBDD using computational group theory, In Proc. CP'03, pages 333-347, 2003.
9. Crawford J. A theoretical analysis of reasoning by symmetry in first order logic. Technical report, AT&T Bell Laboratories, 1996.
10. Crawford J., Ginsberg M., Luks E., and Roy A. Symmetry-breaking predicates for search problems. In Proc. KR'96, pages 149-159, 1996.
11. Slaney J. Finite domain enumerator, system description, In Proc. 12th Int'l Conf. on Automated Deduction (CADE-12), pages 798-801, 1994.
12. Zhang J. Constructing finite algebras with FALCON, Journal of Automated Reasoning, 17(1): 1-22, 1996.
13. Zhang J. Computer search for counterexamples to Wilkie's identity. In Proc. 20th International Conference on Automated Deduction (CADE-20), pages 441-451, 2005.
14. Zhang J. and Zhang H. SEM: a system for enumerating models. In Proc. 14th Int'l Joint Conf. on Artificial Intelligence (IJCAI), pages 298-303, 1995.
15. Claessen K. and Sörensson N. New techniques that improve mace-style finite model finding. In Proceedings of the CADE-19 Workshop: Model Computation - Principles, Algorithms, Applications (Miami, USA), 2003.
16. Fujita M., Slaney J., and Bennett F. Automatic generation of some results in finite algebra, In Proc. 13th Int'l Joint Conf. on Artificial Intelligence (IJCAI), pages 52-57, 1993.
17. Eén N. and Sörensson N. The MiniSat page. Webpage, Chalmers University, http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat/, 2005.
18. Peltier N. A new method for automated finite model building exploiting failures and symmetries. J. of Logic and Computation, 8(4):511-543, 1998.
19. Burris S. and Lee S. Small models of the high school identities. Intl J. of Algebra and Computatio, 2:139-178, 1992.
20. Fahle T., Schamberger S., and Sellmann M. Symmetry breaking, In Proc. CP'01, pages 93-107, 2001.
21. McCune W. MACE 2.0 reference manual and guide. Technical Report No. 249, Argonne National Laboratory, Argonne, IL, USA, 2001.
22. McCune W. Mace4 reference manual and guide, Technical Report No. 264, Argorme National Laboratory, Argonne, IL, USA, 2003.