Simplification of Teleo-Reactive Sequences (2003)
| Citations: | 1 - 0 self |
BibTeX
@TECHREPORT{Mousavi03simplificationof,
author = {Seyed R. Mousavi and Krysia Broda},
title = {Simplification of Teleo-Reactive Sequences},
institution = {},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A Teleo-Reactive (TR) sequence is a sequence of <situation � action> rules. The output of a TR sequence is the action part of the first rule in the sequence whose situation part evaluates to true. In this report, we present an algorithm for simplification of TR sequences, by which we mean to obtain another TR sequence, if any, that is smaller but semantically equal to the given one. The simplification algorithm can also be applied to decision lists, because a decision list is a special case of a TR sequence in that the only actions are true (1) and false (0). We also discuss how the algorithm can be extended in order to simplify multivariable decision trees. Finally, we extend the use of the simplification algorithm to simplifying classification rules.
Citations
No citations identified.
