ACQUISITION OF UNCERTAIN RULES IN A PROBABILISTIC LOGIC
dc.contributor.author | Cleary, John G. | eng |
dc.date.accessioned | 2008-02-27T16:56:34Z | |
dc.date.available | 2008-02-27T16:56:34Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1986-10-01 | eng |
dc.description.abstract | The problem of acquiring uncertain rules from examples is considered. The uncertain rules are expressed using a simple probabilistic logic which obeys all the axioms of propositional logic. By using three truth values (true, false, undefined) a consistent expression of contradictory evidence is obtained. As well the logic is able to express the correlations between rules and to deal both with uncertain rules and with uncertain evidence. It is shown that there is a subclass of such rules where the probabilities of correlations between the rules can be directly computed from examples. | eng |
dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
dc.identifier.department | 1986-244-18 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30522 | |
dc.identifier.uri | http://hdl.handle.net/1880/45821 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | ACQUISITION OF UNCERTAIN RULES IN A PROBABILISTIC LOGIC | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |