




Description 
This module implments an automated algortihm to simplify sequential teams. The
simplification is based on conditional independences. Conditional independence
is checked using the Bayes Ball algorithm
http://citeseer.ist.psu.edu/old/399661.html


Synopsis 



Documentation 

module Data.Teams.Graph 

Determine conditional independence



Requisite observations
The observation nodes are thouse nodes in the condition that are marked as
visited



Irrelevant nodes
The nodes that have not been visited from their parents are irrelevant



Functionally determined nodes
Nodes that are irrelevant when we want to know about all variable nodes



Effectively observed nodes
All the ancestors of the reward nodes that are functionally determined by
conditioned nodes.


Structural results for teams



The graph restructuring algorithm of the paper.



Simplify all nodes of the graph once



The graph simplification aglorithm of the paper
I believe that this algorithm will always converge. So, I do not stop the
loop after a finite number of iterations. If you find an example that does
not converge, please let me know.


Produced by Haddock version 2.4.2 