๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Evidential support logic, FRIL and case based reasoning

โœ Scribed by J. F. Baldwin


Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
942 KB
Volume
8
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

โœฆ Synopsis


Knowledge representation for expert systems and decision support systems is often in the form of rules and answering queries is performed by backward and forward reasoning. Case based reasoning is an alternative to this. In its most basic form, a query is answered by reference with data given as part of the query to similar cases in a data base. In this article we will use a mixture of case based reasoning and rule inference methods. Rules will represent generalizations of information relevant to prototypical cases. The prototypical cases are chosen from a database of examples. Partial matchings of features in a rule are used to infer a conclusion even when information to evaluate the body of the rule is incomplete. Features are given importance weights and inferred conclusions from various rules are combined using mass assignment theory 0 1993 John Wiley & Sons. Inc.

I. INTRODUCTION

Knowledge representation for expert systems and decision support systems is often in the form of rules and answering queries is performed by backward and forward reasoning. For application to control see Refs. I and 2.

Rules take the form of head IF body : p where p is optional. If p is given this is interpreted as Pr(head1body) = p . If no p is given then the rule is interpreted as body 3 head. The body is of the conjunctive form headl, . . . , headn where headi is either a head of another rule or a fact in the knowledge base.

The truth or probability of the body is determined using the logic or probability rules for conjunction which ever is appropriate.

We can generalize this further by allowing for p to be an interval containing the probability of the head given the body. This interval, [ a , p ] , is called a *Professor J. F. Baldwin is a SERC Senior Research Fellow.


๐Ÿ“œ SIMILAR VOLUMES


Hierarchical case-based reasoning to sup
โœ P. Richards; A. Ekรกrt ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier ๐ŸŒ English โš– 531 KB

Knitwear design is a creative activity that is hard to automate using the computer. The production of the associated knitting pattern, however, is repetitive, time-consuming and error-prone, calling for automation. Our objectives are two-fold: to facilitate the design and to ease the burden of calcu

An efficient triplet-based algorithm for
โœ Yaxin Bi ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 406 KB

Linear-time computational techniques based on the structure of an evidence space have been developed for combining multiple pieces of evidence using Dempster's rule (orthogonal sum), which is available on a number of contending hypotheses. They offer a means of making the computation-intensive calcu

A case-based reasoning approach to suppo
โœ Laurence Capus; Nicole Tourigny ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 231 KB

The automatic generation of summaries using cases (GARUCAS) environment was designed as an intelligent system to help one learn to summarize narrative texts by means of examples within a case-based reasoning (CBR) approach. Each example, modeled as a case, contains a conceptual representation of the

Abductive case-based reasoning
โœ Zhaohao Sun; Gavin Finnie; Klaus Weber ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 175 KB

This article introduces abductive case-based reasoning ~CBR! and attempts to show that abductive CBR and deductive CBR can be integrated in clinical process and problem solving. Then it provides a unified formalization for integration of abduction, abductive CBR, deduction, and deductive CBR. This a