uf:totam
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | Next revisionBoth sides next revision | ||
| uf:totam [2010/01/21 17:35] – updating elisag | uf:totam [2010/01/21 17:35] – elisag | ||
|---|---|---|---|
| Line 72: | Line 72: | ||
| def decideSleep() -> boolean | def decideSleep() -> boolean | ||
| </ | </ | ||
| + | |||
| + | Ideas: | ||
| + | |||
| + | TOTA could be combined with the RETE engine we built for the characteristic functions, in the future to reason about multiple tuples. | ||
| decideSleep() is there for discontinuous decidePropagation functions. for example, tuples that should be only propagated every Tuesday could not implemented with TOTA because the propagation protocol only gets called once. We change this by providing decideSleep() that gets called when you decide not to propagate. Like this a tuple can still be propagate at a later point in time, despite the fact that the decidePropagation function has evaluated to false at a certain moment. | decideSleep() is there for discontinuous decidePropagation functions. for example, tuples that should be only propagated every Tuesday could not implemented with TOTA because the propagation protocol only gets called once. We change this by providing decideSleep() that gets called when you decide not to propagate. Like this a tuple can still be propagate at a later point in time, despite the fact that the decidePropagation function has evaluated to false at a certain moment. | ||
uf/totam.txt · Last modified: 2021/09/24 10:49 by elisag