29. The method of claim 28 , further comprising characterizing said declarative rules by a dependency network.
29. The method of claim 28 , further comprising characterizing said declarative rules by a dependency network. 30. The method of claim 29 , further comprising converting said dependency network to a directed acyclic graph (DAG) in order to eliminate loops in said network.