Advertisement

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

  • Werner Dilger
  • Wolfgang Womann
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 215)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Barr, A. and E.A. Feigenbaum (ed): The Handbook of Artificial Intelligence. Stanford, 1981.Google Scholar
  2. [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. [3]
    Dershowitz, N. and Z. Manna: Proving Termination with Multiset Orderings. Comm. of the ACM 16 (1973) 465–476.Google Scholar
  4. [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. [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. [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. [7]
    Hendrix, G.G.: Encoding knowledge in Partitioned Networks. in Findler N. (ed.): Associative Networks. New York (1979).Google Scholar
  8. [8]
    Huet, G.: confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Journal of the ACM 27 (1980) 797–821.Google Scholar
  9. [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. [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. [11]
    Findler, N.V. (ed.): Associative networks representation and use of knowledge by computers. Academic Press, New York (1979).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Werner Dilger
    • 1
  • Wolfgang Womann
    • 2
  1. 1.Institut für Informations- und DatenverarbeitungKarlsruhe 1
  2. 2.Nixdorf Computer AGMünchen 40

Personalised recommendations