Skip to main content

The METANET. A knowledge representation tool based on abstract data types

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Methods of Specification and Synthesis of Software Systems '85 (MMSSS 1985)

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

  • 150 Accesses

Abstract

The schema METANET is the specification of some kind of generalized semantic network as abstract data type. The theoretical basis of this work, namely Σ-termalgebras and rewrite rule systems, is introduced. It is described how the axiom schemas of the METANET arise by abstraction from real axioms and how axioms can be derived from axiom schemas by instantiation in turn, yielding a specification of a concrete sort of semantic networks. Some remarks on the properties and the use of METANET are passed.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barr, A. and E.A. Feigenbaum (ed): The Handbook of Artificial Intelligence. Stanford, 1981.

    Google Scholar 

  2. Brachman, R.J.: What's in a concept: Structural foundations for Semantic Networks. Int. J. Man-Machine Studies 9 (1977) 127–152.

    Google Scholar 

  3. Dershowitz, N. and Z. Manna: Proving Termination with Multiset Orderings. Comm. of the ACM 16 (1973) 465–476.

    Google Scholar 

  4. Dilger, W. and W. Womann: Semantic Networks as Abstract Data Types. Proc. of the 8th Int. Conference on Artificial Intelligence Karlsruhe (1983) 321–324.

    Google Scholar 

  5. Dilger, W. and W. Womann: The METANET. A Means for the Specification of Semantic Networks as Abstract Data Types. Int. J. ManMachine Studies (1984).

    Google Scholar 

  6. Goguen, J.A., J.W. Thatcher and E.G. Wagner: An initial algebra approach to the specification, correctness, and implementation of abstract data types. in Yeh R.T. (ed.): Current Trends in Programming Methodology, Volume IV, Data Structuring, 1976.

    Google Scholar 

  7. Hendrix, G.G.: Encoding knowledge in Partitioned Networks. in Findler N. (ed.): Associative Networks. New York (1979).

    Google Scholar 

  8. Huet, G.: confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Journal of the ACM 27 (1980) 797–821.

    Google Scholar 

  9. Knuth, E. and P.B. Bendix: Simple word problems in universal algebras. in Leech J. (ed.): Computational Problems in Universal Algebras. Oxford (1969).

    Google Scholar 

  10. Manna, Z., S. Ness and J. Vuillemin: Inductive Methods for Proving Properties of Programs. Comm. of the ACM 16 (1973) 491–504.

    Google Scholar 

  11. Findler, N.V. (ed.): Associative networks representation and use of knowledge by computers. Academic Press, New York (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dilger, W., Womann, W. (1986). The METANET. A knowledge representation tool based on abstract data types. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16444-9

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics