Mapping and combining combinatorial problems into energy landscapes via pseudo-boolean constraints

Authors:
Priscila M. V. Lima;Glaucia C. Pereira;M. Mariela M. Morveli-Espinoza;Felipe M. G. França
Affiliations:
NCE/Instituto de Matemática, UFRJ, Rio de Janeiro, Brazil;COPPE – Sistemas e Computação, UFRJ, Rio de Janeiro, Brazil;COPPE – Sistemas e Computação, UFRJ, Rio de Janeiro, Brazil;COPPE – Sistemas e Computação, UFRJ, Rio de Janeiro, Brazil
Venue:
BVAI'05 Proceedings of the First international conference on Brain, Vision, and Artificial Intelligence
Year:
2005

Citing 4
Cited 1

On the distributed parallel simulation of Hopefield's neural networks

Software—Practice & Experience
The Z notation: a reference manual

The Z notation: a reference manual
Logical inference in symmetric connectionist networks

Logical inference in symmetric connectionist networks
Generalizing Boolean satisfiability I: background and survey of existing work

Journal of Artificial Intelligence Research

Logic as energy: a SAT-based approach

BVAI'07 Proceedings of the 2nd international conference on Advances in brain, vision and artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

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.