A feasibility study on compiling reactive problem solution methods for an Al domain

Graduate Thesis Or Dissertation

Público Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/h702q9674

Descriptions

Attribute Name	Values
Creator	Kaul, Lothar
Abstract	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.
Resource Type	Masters Thesis
Fecha Disponible	2013-02-04T17:00:30+00:00
Fecha de Emisión	1991-05-07
Degree Level	Master's
Degree Name	Master of Science (M.S.)
Degree Field	Computer Science
Degree Grantor	Oregon State University
Commencement Year	1992
Advisor	D'Ambrosio, Bruce
Academic Affiliation	Computer Science
Non-Academic Affiliation	Oregon State University. Graduate School
Subject	Decision-making -- Data processing Artificial intelligence Compiling (Electronic computers)
Declaración de derechos	Copyright Not Evaluated
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]
Digitization Specifications	File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6770A in PDF format. CVista PdfCompressor 5.0 was used for pdf compression and textual OCR.
Replaces	http://hdl.handle.net/1957/36555

Parents:

This work has no parents.

En Collection:

Miniatura	Título	Fecha de subida	Visibilidad	Acciones
	KaulLothar1992.pdf	2017-08-20	Público	Descargar