Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems

IPMU 1992: IPMU '92—Advanced Methods in Artificial Intelligence pp 321–329Cite as

On knowledge base redundancy under uncertain reasoning

  • Knowledge Based Systems
  • Conference paper
  • First Online:

  • 175 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 682))

Abstract

Current notions of redundancy and subsumption for knowledge bases under boolean reasoning are extended in this paper to approximate reasoning. The extension is based on the folding of rules under uncertain reasoning as the basic operation for computing rule trees. In this way global subsumption can also be detected under approximate reasoning. A new method for the detection and removal of all redundant and subsumed rules under approximate reasoning, based on graph transformations, is also presented.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ayel and J.-P. Laurent, editors. Validation, Verification and Test of Knowledge-Based Systems, Chichester, England, 1991. John Wiley & Sons.

    Google Scholar 

  2. W. Buntine. Generalized Subsumption and its Applications to Induction and Redundancy. Artificial Intelligence, 36(2):149–176, Sept. 1988.

    Article  Google Scholar 

  3. H. Ehrig and A. Habel. Graph Grammars with Application Conditions. In G. Rozenberg and A. Salomaa, editors, The Book of L, pages 87–100. Springer-Verlag, Berlin, 1985.

    Google Scholar 

  4. H. Ehrig, M. Korff, and M. Löwe. Tutorial Introduction to the Algebraic Approach of Graph Grammars based on Double and Single Pushouts. In H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors, Proc. 4th Int. Workshop on Graph-Grammars and their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 24–37, Berlin, 1991. Springer-Verlag.

    Google Scholar 

  5. U. G. Gupta, editor. Validating and Verifying Knowledge-Based Systems, Los Alamitos, California, 1991. IEEE Computer Society Press.

    Google Scholar 

  6. M. Löwe. Extended Algebraic Graph Transformation. PhD thesis, Fachbereich Informatik, Technische Universität Berlin, 1991.

    Google Scholar 

  7. H. Tamaki and T. Sato. Unfold/Fold Transformation of Logic Programs. In Proc. 2nd Int. Logic Programming Conference, pages 127–138, Uppsala, Sweden, July 1984.

    Google Scholar 

  8. G. Valiente. Verification of Knowledge Base Redundancy and Subsumption using Graph Transformations. To appear in The Int. Journal of Expert Systems: Research & Applications, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. de Ciències Matemàtiques i Informàtica, Universitat de les Illes Balears, E-07071, Palma (Balears), Spain

    Gabriel Valiente Feruglio

Authors
  1. Gabriel Valiente Feruglio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernadette Bouchon-Meunier Llorenç Valverde Ronald R. Yager

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag

About this paper

Cite this paper

Feruglio, G.V. (1993). On knowledge base redundancy under uncertain reasoning. In: Bouchon-Meunier, B., Valverde, L., Yager, R.R. (eds) IPMU '92—Advanced Methods in Artificial Intelligence. IPMU 1992. Lecture Notes in Computer Science, vol 682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56735-6_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-56735-6_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56735-6

  • Online ISBN: 978-3-540-47643-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation