By Topic

Using paths to detect redundancy in rule bases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chandler, P.G. ; Dept. of Comput. Sci., Concordia Univ., Montreal, Que., Canada ; Radhakrishnan, T. ; Shinghal, R.

One of the major causes of inefficiency in rule-based systems is rule base redundancy; hence, its detection is an actively pursued research topic. Most of the existing methods consider rule base redundancy at two levels: at the rule level and at the level of rule sequences or rule chains. The computational complexity and the extent of redundancy that can be detected are two measures of performance that can be used to compare different methods of redundancy detection. We propose the use of “paths” for redundancy detection. Starting from a specification mechanism to abstract the problem solving knowledge of the domain, called goal specification, we have developed software tools for efficient extraction of paths. Based on such paths, we identify rule situations called “rule aberrations” which form the core of the algorithm proposed for redundancy detection. For illustration, the algorithm is applied to an example rule base, and redundant rules and atoms are detected. Our method of redundancy detection is also compared with the existing approaches

Published in:

Artificial Intelligence for Applications, 1995. Proceedings., 11th Conference on

Date of Conference:

20-23 Feb 1995