Automatic symmetry breaking method combined with SAT

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2001, Pages 17-21

  Zhang, Jian ^a  

^a INSTITUTE OF SOFTWARE   (China)

Author keywords

Backtracking search; Finite models; Symmetry

Indexed keywords

CRYSTAL SYMMETRY; LOGIC PROGRAMMING;

BACKTRACKING SEARCH; COMPUTATIONAL LOGIC; FINITE MODEL; FIRST-ORDER FORMULAS; PRE-PROCESSING STEP; PROPOSITIONAL SATISFIABILITY; SYMMETRY-BREAKING; UNIT PROPAGATION;

FORMAL LOGIC;

EID: 10044292641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/372202.372206     Document Type: Conference Paper

References (8)

1. Benhamou B., and Sais, L. Tractability through symmetries in propositional calculus. Journal of Automated Reasoning, 12 (1994), 89-102.
2. Fujita, M., Slaney, J., and Bennett, F. Automatic generation of some results in finite algebra. in Proc. of IJCAI-93, 52-57.
3. Kim, S., and Zhang, H. ModGen: Theorem proving by model generation. In Proc. of AAAI-94, 162-167.
4. McCune, W. A Davis-Putnam program and its application to finite first-order model search: Quasigroup existence problems. Tech. Memo ANL/MCS-TM-194, Argonne National Laboratory, Argonne, IL., USA, 1994. http://www-unix.mcs.anl.gov/AR/mace
5. McCune, W. Automatic proofs and counterexamples for some ortholattice identities. Information Processing Letters 65 (1998), 285-291.
6. Slaney, J., Fujita, M., and Stickel, M. Automated reasoning and exhaustive search: Quasigroup existence problems. Computers & Mathematics with Applications 29 (1995), 115-132.
7. Wos, L. The kernel strategy and its use for the study of combinatory logic. Journal of Automated Reasoning, 10 (1993), 287-343.
8. Zhang, J., and Zhang, H. SEM: a system for enumerating models. In Proceedings of IJCAI-95, 298-303.