KBS maintenance as learning two-tiered domain representation

  • Gennady Agre
Scientific Sessions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1010)


The paper deals with the problem of improving problem-solving behavior of traditional KBS in the course of its real operation which is a part of the maintenance task. The solution of the problem is searched in integration of the KBS with a specially designed case-based reasoning module used for correcting solutions produced by the KBS. Special attention is paid to the methods of case matching and reconciling conflicts between CBR and RBR. The proposed solution for both problems is based on treating the maintenance task as a problem for learning two-tiered domain representation. From this view point rules form the first domain tier reflecting existing strong patterns in the representation of domain concepts, while the second tier is formed by the newly solved cases along with a special domain-dependent procedure for case matching. The main ideas of the approach are illustrated by the results of some experiments with the experimental system CoRCase.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aamodt, A.: Knowledge-intensive, integrated approach to problem solving and sustained learning. Ph.D. Dissertation, University of Trondheim (1991).Google Scholar
  2. 2.
    Agre, G.: Improvement of KBS Behavior by Using Problem-Solving Experience. Ph. Jorrand and V. Sgurev (Eds.), Proc. of the VIth Int. Conference AIMSA '94, World Scientific Publ., Singapore (1994) 257–266.Google Scholar
  3. 3.
    Agre, G.: An Approach to Integration of Rule-Based and Case-Based Reasoning. Problems of Engineering Cybernetics and Robotics, 42, Bulgarian Academy of Sciences, Sofia (1995) 40–49.Google Scholar
  4. 4.
    Barsalou, L., Hale, C.: Components of conceptual representation: from feature lists to recursive frames. I. Van Mechelen, J. Hampton, R.S. Michalsi and P. Theuns (Eds.) Categories and Concepts — Theoretical Views and Inductive Data Analysis, Academic Press (1993) 97–144.Google Scholar
  5. 5.
    Bergadano, F., Matwin, S., Michalski R.S., Zhang, J.: Learning two-tiered description of flexible concepts: the POSEIDON system. Machine Learning 8 (1992) 5–43.Google Scholar
  6. 6.
    Biberman, Y.: A Contex Similarity Measure. F. Bergadano and L. De Raedt (Eds.) Machine Learning: ECML-94. LNAI 784, Springer-Verlag (1994) 48–63Google Scholar
  7. 7.
    Coenen, F., Bench-Capon, T.: Maintenance of Knowledge-Based Systems: Theory, Techniques and Tools, Academic Press (1993).Google Scholar
  8. 8.
    Golding A.R., Rosenbloom, P.S.: Improving rule-based systems through case-based reasoning. Proceedings of the National Conference on Artificial Intelligence, Anaheim, MIT Press (1991) 22–27.Google Scholar
  9. 9.
    Hammond, K.: Case-Based Planning: Viewing Planning as a Memory Task. Academic Press (1989).Google Scholar
  10. 10.
    Iordanova I., Giacometti, A., Vila, A., Amy, B., Reymond, F., Abaoub, L., Dahou M., Rialle, V.: Shade — A Hybrid System for Diagnosis in Electromyography. Proc. of IXth Int. Congress on Electromyography, Jerusalem (1992).Google Scholar
  11. 11.
    Kolodner, J.L.: Extending problem solver capabilities through case-based inference. Proc. of 4th Workshop on Machine Learning, UC-Irvine, June 22–25 (1987) 167–178.Google Scholar
  12. 12.
    Markov, Z.: Private communication (1995).Google Scholar
  13. 13.
    Matwin, S., Plante, B.: A Deductive-Inductive Method For Theory Revision. R.S. Michalski and Gh. Tecuci (Eds.) Proc. of the First Int. Workshop on Multistrategy Learning (1991) Harpers Ferry, 160–174.Google Scholar
  14. 14.
    Michalski R.S.: Learning flexible concepts: fundamental ideas and a method based on two-tiered representation. Y. Kodratoff and R.S. Michalski (Eds.) Machine Learning: an Artificial Intelligence Approach 3, San Mateo, CA: Morgan Kaufmann (1990) 63–111.Google Scholar
  15. 15.
    Mitchell, T.M., R. Keller, Kedar-Cabelli, S.: Explanation-Based Generalization: A unifying view. Machine Learning 1 (1986) 47–80.Google Scholar
  16. 16.
    Cost, S., Salzberg, S.: A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning 10(1) (1991) 56–78.Google Scholar
  17. 17.
    Stanfill, C., Waltz, D.: Toward memory-based reasoning. Communication of ACM 29(12) (1986) 1213–1229.Google Scholar
  18. 18.
    Zhang, J.: Integrating Symbolic and Subsymbolic Approaches in Learning Flexible Concepts. R.S. Michalski and Gh. Tecuci (Eds.) Proc. of the First Int. Workshop on Multistrategy Learning, Harpers Ferry (1991) 289–304.Google Scholar
  19. 19.
    Zhang, J.: Selecting Typical Instances in Instance-Based Learning. D. Sleeman and P. Edwards (Eds.) Machine Learning — Proc. of the Ninth Int. Workshop (ML02), San Mateo, CA: Morgan Kaufmann (1992) 470–479Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Gennady Agre
    • 1
  1. 1.Institute of Information TechnologiesBulgarian Academy of SciencesSofiaBulgaria

Personalised recommendations