Theoretical study on mixed parallel execution for solving SAT

International Congress Series

Volumn 1301, Issue , 2007, Pages 176-179

  Zhang, Kairong ^a   Nagamatu, Masahiro ^b  

^a Mitsubishi Motor Corporation   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Neural network; Parallelization; Satisfiability problem

Indexed keywords

EID: 34250013076     PISSN: 05315131     EISSN: None     Source Type: Book Series    
DOI: 10.1016/j.ics.2006.12.021     Document Type: Article

References (4)

1. Selman B., Levesque H., and Mitchell D. A new method for solving hard satisfiability problem. Proceedings Tenth National Conference on Artificial Intelligence (AAA-92) (1992) 440-446
2. Nagamatu M., and Yannaru T. On the stability of Lagrange programming neural networks of satisfiability problems of propositional calculus. Neurocomputing 13 (1995) 119-133
3. Nagamatu M., and Yannaru T. Parallel state space search for SAT with Lagrange Programming Neural Network. Proceedings of the fifth International Conference on Neural Information Processing (October 1998)
4. Zhang K., and Nagamatu M. Parallel Execution of Neural Networks with Mixed Biases for Solving Satisfiability Problem. International Journal of Innovative Computing, Information and Control 1 4 (2005) 643-657