Abstract
Boolean satisfiability (SAT) problems are an important subset of constraint satisfaction problems (CSPs) which have application in such areas as computer aided design, computer vision, planning, resource allocation and temporal reasoning. In this paper we describe an implementation of an incomplete heuristic search algorithm called GSAT to solve 3-SAT problems. In contrast to other approaches, our design is runtime configurable. The input to this system is a 3-SAT problem from which a software program directly generates a problem-specific configuration which can be directly downloaded to a Xilinx XC6216, avoiding the need for resynthesis, placement and routing for different constraints. We envisage that such systems could be used in hardware based real time constraint solving systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Selman, B., et al.: A new method for solving hard satisfiability problems. In: Proc. of AAAI 1992, pp. 440–446 (1992)
Yokoo, M., et al.: Solving satisfiability problems using field programmable gate arrays: First results. In: Proc. of the 2nd Inter. Conf. on Principles and Practice of Constraint programming, pp. 497–509 (1996)
Zhong, P., et al.: Accelerating boolean satisfiability with configurable hardware. In: IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 186–195 (1998)
Hamadi, Y., Merceron, D.: Reconfigurable architectures: A new vision for optimization problems. In: Principles and Practice of Constraint Programming CP 1997, Austria, pp. 209–215 (1997)
Suyama, T., et al.: Solving satisfiability problems using logic synthesis and reconfigurable hardware. In: Proc. 31st Annual Hawaii Internation Conf. on System Sciences
X. Inc., XC6200 Programmable Gate Arrays (data sheet) (1997)
Dimacs challenge benchmarks, ftp://dimacs.rutgers.edu/pub/challenge
Mitchell, D., et al.: Hard and easy distributions of sat problems. In: Proc. AAAI 1992, pp. 459–465 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yung, W.H., Seung, Y.W., Lee, K.H., Leong, P.H.W. (1999). A Runtime Reconfigurable Implementation of the GSAT Algorithm. In: Lysaght, P., Irvine, J., Hartenstein, R. (eds) Field Programmable Logic and Applications. FPL 1999. Lecture Notes in Computer Science, vol 1673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48302-1_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-48302-1_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66457-4
Online ISBN: 978-3-540-48302-1
eBook Packages: Springer Book Archive