Currently, predicates involve the binary comparison of two values: the high-level-knowledge value at the current timestep, and a reference value; the specified binary operator is evaluated using these two values to determine the truth of the predicate. We want to add capability for more complex comparison than binary comparison.
Maybe predicate operators should be functions that output a boolean? Is there a way to control/verify that performance (probably not, thanks dynamic typing)
Currently, predicates involve the binary comparison of two values: the high-level-knowledge value at the current timestep, and a reference value; the specified binary operator is evaluated using these two values to determine the truth of the predicate. We want to add capability for more complex comparison than binary comparison.
Maybe predicate operators should be functions that output a boolean? Is there a way to control/verify that performance (probably not, thanks dynamic typing)