Message-passing automata are expressively equivalent to EMSO logic.
Benedikt BolligMartin LeuckerPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- message passing
- belief propagation
- probabilistic inference
- distributed systems
- approximate inference
- inference in graphical models
- cellular automata
- shared memory
- factor graphs
- ldpc codes
- sum product algorithm
- markov random field
- distributed shared memory
- logic programming
- graphical models
- graph cuts
- pairwise
- loopy belief propagation
- matrix multiplication
- reinforcement learning
- computer vision