Message-Passing Automata Are Expressively Equivalent to EMSO Logic.
Benedikt BolligMartin LeuckerPublished in: CONCUR (2004)
Keyphrases
- message passing
- belief propagation
- distributed systems
- probabilistic inference
- distributed shared memory
- shared memory
- logic programming
- inference in graphical models
- factor graphs
- approximate inference
- markov random field
- graph cuts
- sum product algorithm
- cellular automata
- temporal logic
- message passing interface
- stereo matching
- regular expressions
- multi view
- junction tree
- matrix multiplication