M. Yokoo, T. Suyama, and H. Sawada. Solving satisfiability problems using field programmable gate arrays: First results. In Second International Conference on Principles and Practice of Constraint Programming, pages 497--509, 1996. 15  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Reconfigurable architectures: A new vision for optimization.. - Hamadi, Merceron (1997) (4 citations) (Correct)
....useful in satisfaction problem solving (SAT) and more generally in optimization problems (MAX SAT) These include several AI problems and more particularly planning, scheduling and artificial vision. As the prime work combining satisfiability problems and reconfigurable hardware we can refer to [YSS96]. The hardware power was also used in [CS92] where a specific digital circuit running a massively parallel algorithm for arc consistency is realized. Hence, using hardware with major tasks in AI is nowadays of great interest. Since it becomes obvious that it is more efficient to adapt hardware to ....
M. Yokoo, T. Suyama, and H. Sawada. Solving satisfiability problems using field programmable gate arrays: First results. In Second International Conference on Principles and Practice of Constraint Programming, pages 497--509, 1996. 15
A Runtime Reconfigurable Implementation of the GSAT Algorithm - Wong Hiu (1999) (1 citation) (Correct)
....of sums form. Each sum term is called a clause and is the sum of single literals, where a literal is a variable or its 2 H.Y. Wong et al. negation. If there are n literals in each clause, the problem is called an n SAT problem. Several hardware designs which solve CSPs have been proposed [2 5] and all shown significant speed improvement over software implementations. An important limitation of all of the complete and incomplete implementations described above is that they generated a high level description of a circuit which was customised for the constraint problem. Thus a complete ....
M. Yokoo 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.
Solving Satisfiability Problems Using Reconfigurable.. - Suyama, Yokoo, Sawada.. Self-citation (Yokoo Suyama Sawada) (Correct)
....task shown to be NP hard [8] In this paper, we report on an innovative approach for solving SAT using the reconfigurable computing approach to create a Manuscript received February 28, 2000; revised July 15, 2000. This paper is an extended version of the authors previous conference papers [1] [3] T. Suyama is with Research and Development Center, NTT West, Tokyo, Japan (e mail: t.suyama rdc.west.ntt.co.jp) M. Yokoo and H. Sawada are with NTT Communication Science Laboratories, Kyoto, Japan (e mail: yokoo cslab.kecl.ntt.co.jp; sawada cslab. kecl.ntt.co.jp) A. Nagoya is with NTT ....
....A. Nagoya is with NTT Network Innovation Laboratories, Kanagawa, Japan (e mail: nagoya exa.onlab.ntt.co.jp) Publisher Item Identifier S 1063 8210(01)00713 2. logic circuit that is specialized to solve each problem instance on FPGAs. After the authors presented an initial report on this approach [1], various research efforts following this line have been carried out [9] 15] Consequently, solving SAT using FPGAs has become a vital research area. In the remainder of the paper, we briefly describe the problem definition in Section II and the reconfigurable computing approach in Section III. ....
[Article contains additional citation context not shown here]
M. Yokoo, T. Suyama, and H. Sawada, "Solving satisfiability problems using field programmable gate arrays: First results," in Proc. 2nd Int. Conf. Principles Practice Constraint Programming (CP'96), 1996, pp. 497--509.
Solving Satisfiability Problems on FPGAs using.. - Suyama, Yokoo, Nagoya (1999) (2 citations) Self-citation (Yokoo Suyama) (Correct)
....and many theoretical and experimental studies have been performed on these problems [10] In particular, a satisfiability problem for propositional formulas in conjunctive normal form (SAT) is an important subclass of CSP. This problem was the first computational task shown to be NP hard. In [17], we presented an initial report on innovative approach for solving satisfiability problems. In this approach, a logic circuit that is specialized to solve each problem instance is created on FPGAs. After this pioneer work, various researches following this line have been carried out [1, 8, 13, ....
....that is specialized to solve each problem instance is created on FPGAs. After this pioneer work, various researches following this line have been carried out [1, 8, 13, 16, 18] As such, solving SAT using FPGAs is becoming a very vital research area. The performance of the method described in [17] is equivalent to the basic Davis Putnam procedure [5] and the performance is not very efficient since the variable ordering is static. In [16] weintroduced dynamic variable ordering with Maximum Occurrences in clauses of Minimum Size (Mom s) heuristic [6, 7] However, wewere not able to ....
Yokoo, M., Suyama, T., and Sawada, H.: Solving satisfiability problems using field programmable gate arrays: First results, Proc. of the Second International ConferenceonPrinciples and PracticeofConstraint Programming, Springer-Verlag (1996) 497--509
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC