Abstract
This paper introduces a novel approach to the specification of hard combinatorial problems as pseudo-Boolean constraints. It is shown (i) how this set of constraints defines an energy landscape representing the space state of solutions of the target problem, and (ii) how easy is to combine different problems into new ones mostly via the union of the corresponding constraints. Graph colouring and Traveling Salesperson Problem (TSP) were chosen as the basic problems from which new combinations were investigated. Higher-order Hopfield networks of stochastic neurons were adopted as search engines in order to solve the mapped problems.
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
Barbosa, V.C., Lima, P.M.V.: On the distributed parallel simulation of Hopfield’s neural networks. Software-Practice and Experience 20(10), 967–983 (1990)
Dixon, H.E., Ginsberg, M.L., Parkes, A.J.: Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. Journal of Artificial Intelligence Research 21, 193–243 (2004)
Geman, S., Geman, D.: Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-6, 721–741 (1984)
Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. of the National Academy of Sciences USA 79, 2554–2558 (1982)
Hopfield, J.J., Tank, D.W.: Neural computation of decisions in optimization problems. Biological Cybernetics 52, 141–152 (1985)
Jones, A.J.: Models of Living Systems: Evolution and Neurology. Lecture Notes. Department of Computing. Imperial College of Science, Technology and Medicine, London, UK (1994)
Kirkpatrick, S., Gellat Jr., C.D., Vecchi, M.P.: Optimization via Simulated Annealing. Science 220, 671–680 (1983)
Lima, P.M.V.: Resolution-Based Inference on Artificial Neural Networks. Ph.D. Thesis, Department of Computing. Imperial College of Science, Technology and Medicine, London, UK (2000)
Lima, P.M.V.: A Goal-Driven Neural Propositional Interpreter. International Journal of Neural Systems 11, 311–322 (2001)
Pinkas, G.: Logical Inference in Symmetric Neural Networks. D.Sc. Thesis, Sever Institute of Technology, Washington University, Saint Louis, USA (1992)
Spivey, M.: The Z Notation: A Reference Manual, 2nd edn. Prentice Hall International Series in Computer Science (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lima, P.M.V., Pereira, G.C., Morveli-Espinoza, M.M.M., França, F.M.G. (2005). Mapping and Combining Combinatorial Problems into Energy Landscapes via Pseudo-Boolean Constraints. In: De Gregorio, M., Di Maio, V., Frucci, M., Musio, C. (eds) Brain, Vision, and Artificial Intelligence. BVAI 2005. Lecture Notes in Computer Science, vol 3704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11565123_30
Download citation
DOI: https://doi.org/10.1007/11565123_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29282-1
Online ISBN: 978-3-540-32029-6
eBook Packages: Computer ScienceComputer Science (R0)