Abstract
The Ripple Down Rule (RDR) is a knowledge acquisition scheme which has been successfully used in large scale commercial applications. Most notable is the use of the scheme in building a knowledge base for interpreting pathology results. Unlike machine learning algorithms which construct theories for raw data, the commercial system using the RDR scheme requires some interaction with an expert to correct erroneous interpretations. However, the frequency of such interactions is very low. Furthermore, the simplicity of the interaction means that a knowledge engineer is not required when updating a knowledge base. A number of RDR variants have been devised for different applications. While Scheffer has given operational semantics to one variant of RDR, translations of RDR into classical logics has not yet been presented in the literature. This paper will show how two variants of RDR, single classification RDR (SCRDR) and multiple classification RDR (MCRDR), have a propositional or first-order core tied with case specific defaults. Such a translation will be used to highlight properties of the RDR scheme which make it successful. Similarities and differences in the two variants will be discussed and RDR revision will also be analysed.
This is an extension of a paper presented at the Fourth Australian Knowledge Acquisition Workshop, 1999, Sydney Australia.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Compton B. Kang and P. Preston. Multiple classification ripple down rules: Evaluation and possibilities. In Proceedings of the 9th Banff Knowledge Acquisition for Knowledge Based Systems Workshop, pages 17.1–7.20, 1995.
G. Beydoun and A. Hoffmann. Incremental acquisition of search knowledge. International Journal of Human Computer Interactions, 52:493–530, 2000.
P. Compton, G. Edwards, B. Kang, L. Lazarus, R. Malor, P. Preston, and A. Srinivasan. Ripple down rules: Turning knowledge acquisition into knowledge maintenance. Artificial Intelligence in Medicine, 4:463–475, 1992.
P. Compton and R. Jansen. A philosophical basis for knowledge acquisition. In Proceedings of the 3rd European Knowledge Acquisition Workshop EKAW ’89, pages 75–89, 1989.
P. Compton, P. Preston, and B. Kang. The use of simulated experts in evaluating knowledge acquisition. In Proceedings of the 9th AAAI-Sponsored Banff Knowledge Acquisition for Knowledge-Based Systems Workshop, pages 12.1–12.18, 1995.
P. Compton, Z. Ramadan, P. Preston, T. Le-Gia, V. Chellen, and M. Mullholland. A trade-off between domain knowledge and problem-solving method power. In Proceedings of the 11th Banff knowledge acquisition for knowledge-based systems workshop, pages Banff, SRDG Publications, University of Calgary. SHARE 17, 1–19, 1998.
M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceedings of the Seventh International Conference on Logic Programming, pages 579–597. MIT Press, 1990.
B. Grosof. Prioritized conflict handling for rules. ibm research report rc 20836(92273). available at http://www.research.ibm.com/people/g/grosof/. Technical report, IBM Research Division, 1997.
H. Mannila J. Kivinen and E. Ukkonen. Learning rules with local exceptions. In Proceedings of the European Conference on Computational Learning Theory: EuroCOLT’93, pages 35–46. Clarendon Press, Oxford, 1994.
R. Kowalski and F. Sadri. Logic prograns with exceptions. New Generation Computing, 9:387–400, 1991.
P. Preston and G. Edwards. A 1600 rule expert system without knowledge engineers. In World Congress on Expert Systems, Lisbon, Portugal, 1994.
R. Rivest. Learning decision lists. Machine Learning, 2(2):229–246, 1987.
Tobias Scheffer. Algebraic foundation and improved methods of induction of ripple down rules. In Proceedings of the Pacific Knowledge Acquisition Workshop PKAW ’96, pages 279–292, 1996.
S. Vere. Multilevel counterfactuals for generalizations of relational concepts and productions. Artificial Intelligence, 14:139–164, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwok, R.B. (2000). Translations of Ripple Down Rules into Logic Formalisms. In: Dieng, R., Corby, O. (eds) Knowledge Engineering and Knowledge Management Methods, Models, and Tools. EKAW 2000. Lecture Notes in Computer Science(), vol 1937. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39967-4_28
Download citation
DOI: https://doi.org/10.1007/3-540-39967-4_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41119-2
Online ISBN: 978-3-540-39967-4
eBook Packages: Springer Book Archive