Show simple item record

dc.contributor.authorCleary, John G.eng
dc.date.accessioned2008-02-27T16:56:34Z
dc.date.available2008-02-27T16:56:34Z
dc.date.issued1986-10-01eng
dc.identifier.urihttp://hdl.handle.net/1880/45821
dc.description.abstractThe 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.language.isoEngeng
dc.subjectComputer Scienceeng
dc.titleACQUISITION OF UNCERTAIN RULES IN A PROBABILISTIC LOGICeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.description.notesWe 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.caeng
dc.identifier.department1986-244-18eng
dc.date.computerscience1999-05-27eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30522
thesis.degree.disciplineComputer Scienceeng


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record