ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Automatic symmetry breaking method combined with SAT
Full text PdfPdf (92 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2001 ACM symposium on Applied computing table of contents
Las Vegas, Nevada, United States
Pages: 17 - 21  
Year of Publication: 2001
ISBN:1-58113-287-5
Author
Jian Zhang  Laboratory of Computer Science, Inst. of Software, Chinese Acad. Sci., P.O. Box 8718, Beijing 100080, China
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 10,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/372202.372206
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
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
Sun Kim , Hantao Zhang, ModGen: theorem proving by model generation, Proceedings of the twelfth national conference on Artificial intelligence (vol. 1), p.162-167, October 1994, Seattle, Washington, United States
 
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
William McCune, Automatic proofs and counterexamples for some ortholattice identities, Information Processing Letters, v.65 n.6, p.285-291, March 27, 1998  [doi>10.1016/S0020-0190(98)00015-5]
 
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.

CITED BY
 
Jun Yan , Jian Zhang, A backtracking search tool for constructing combinatorial test suites, Journal of Systems and Software, v.81 n.10, p.1681-1693, October, 2008

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sorting and searching

Additional Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.3 Deduction and Theorem Proving
          Subjects: Logic programming
      I.2.8 Problem Solving, Control Methods, and Search
          Subjects: Backtracking


General Terms:
Design, Experimentation, Measurement, Performance, Theory


Keywords:
backtracking search, finite models, symmetry

Collaborative Colleagues:
Jian Zhang: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player