Parallel genetic algorithm to solve the satisfiability problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel genetic algorithm to solve the satisfiability problem

Full text

Pdf (578 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1998 ACM symposium on Applied Computing table of contents

Atlanta, Georgia, United States

Pages: 23 - 28

Year of Publication: 1998

ISBN:0-89791-969-6

Authors

Nicole Nemer-Preece	Computer Science Department, University of Missouri-Rolla, 18 Miner Circle, Rolla, Missouri
Ralph Wilkerson	Computer Science Department, University of Missouri-Rolla, 18 Miner Circle, Rolla, Missouri

Sponsors

SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 39, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/330560.330565 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.

	CF90	Wen-Tsuen Chen , Ming-Yi Fang, Theorem proving in propositional logic on vector computers using a generalized Davis-Putnam procedure, Proceedings of the 1990 conference on Supercomputing, p.658-665, October 1990, New York, New York, United States
	DP60	Martin Davis , Hilary Putnam, A Computing Procedure for Quantification Theory, Journal of the ACM (JACM), v.7 n.3, p.201-215, July 1960 [doi>10.1145/321033.321034]
	Gol89	David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	HV95	Hooker, J. N. and Vinay, V. Branching Rules for Satisfiability. Journal of Automated Reasoning, Vol. 15, No. 3, pp. 359 - 383, 1995.
	McC94	McCune, W. A Davis-Putnam Program and its Application to Finite First-Order Model Search: Quasigroup Existence Problems. Technical Report, Argonne National Laboratory, 1994.
	Shu96	Shumsky, Olga. New Methods in Finite First. Order Model Search. Masters Thesis, University of Missouri-Rolla, Rolla, Missouri, 1996.
	WO92	Larry Wos , Ross Overbeek , Ewing Lusk , Jim Boyle, Automated reasoning (2nd ed.): introduction and applications, McGraw-Hill, Inc., New York, NY, 1992
	ZS94	Zhang, H. and Stickel, M. E.. Implement!ng the Davis-Putnam Algorithm by Tries, 1994.

CITED BY 2

	Chris J. Thompson , Sahngyun Hahn , Mark Oskin, Using modern graphics architectures for general-purpose computing: a framework and analysis, Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture, November 18-22, 2002, Istanbul, Turkey
	Souhila Sadeg , Habiba Drias, A selective approach to parallelise Bees Swarm Optimisation metaheuristic: application to MAX-W-SAT, International Journal of Innovative Computing and Applications, v.1 n.2, p.146-158, January 2007