This paper investigates the feasibility of compiling the functionality of a decision
theoretic problem solving engine into a set of rules or functionally similar construct.
The decision theoretic engine runs in exponential time, while the rule set runs in
linear time at worst. The main question that will determine the feasibility is whether
the size of the rule set is small enough to be of practical use. Based on the tests
run, size does not appear to be a limiting factor in compiling rule sets. / Graduation date: 1992
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/36555 |
| Date | 07 May 1991 |
| Creators | Kaul, Lothar |
| Contributors | D'Ambrosio, Bruce |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0017 seconds