Skip to main content

Netlog — A concept oriented logic programming language

  • Session 12: Extensions of Logic Programming
  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 624))

Abstract

A superset of Prolog language is described which covers the main properties of such knowledge representation formalisms as frames and semantic nets. The latter are treated in the framework of the Tseytin's approach to programming with association nets. The proposed language is intended to simplify the programming of complicated though logically integral concepts and their classes. It may be also regarded as (structurally) object-oriented. The application and the implementation issues of this language are also discussed.

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

  • Aït-Kaci H., Nasr R. (1986) LOGIN: A Logic Programming Language with built-in Inheritance. Journal of Logic Programming, 3, pp.185–215.

    Article  Google Scholar 

  • Aït-Kaci H. (1991) Integrating Logic, Functional and Object-Oriented Programming Paradigms. Fifth International Workshop on Unification (UNIF'91), Paris.

    Google Scholar 

  • Appleby K., Carlsson M., Haridi S., Sahlin D. (1988) Garbage Collection for Prolog Based on WAM. Communications of the ACM, Vol. 31, No.6, pp.719–741.

    Article  Google Scholar 

  • Cattell R.G.G. (1991) Object Data Management: Object-Oriented and Extended Relational Database Systems. Addison-Wesley, Reading, Mass.

    Google Scholar 

  • Chikayama T. (1983) ESP — Extended Self-contained Prolog — as a Preliminary Kernel of Fifth Generation Computers. New Generation Computing 1:1, pp. 11–24.

    Google Scholar 

  • Dittrich K.R. (Ed.) (1988) Advances in Object-Oriented Database Systems. Lecture Notes in Computer Science, Vol.334.

    Google Scholar 

  • Freytag J.C., Manthey R., Wallace M. (1988) Mapping Object-Oriented Concepts into Relational Concepts by Meta-Compilation in a Logic Programming Environment. Lecture Notes in Computer Science, Vol.334.

    Google Scholar 

  • Furtado A.L. (1992) Analogy by Generalization — and the Quest of the Grail. ACM SIGPLAN Notices, Vol. 27, No.1, pp.105–113.

    Article  Google Scholar 

  • Horiuchi K., Kanamori T. (1988) Polymorphic Type Inference in Prolog by Abstract Interpretation. Lecture Notes in Computer Science, Vol.315.

    Google Scholar 

  • Jay C, Knaus R.K. (1989) Frames in Prolog, part 2: Unification. AI Expert, May, pp. 19–24.

    Google Scholar 

  • Melichev I.V. (1990). User requirements anticipation and experience acquisition in structure synthesis. In: Artificial Intelligence — Industrial Applications. Leningrad: LIIAN, pp.310–314.

    Google Scholar 

  • Pountain D. (1990). Adding Objects to Prolog. BYTE Magazine. McGraw Hill, Inc. New-York.

    Google Scholar 

  • Tseytin G.S. (1985). Programming with association nets. In: Computers in design and industry, pp. 16–48 (in Russian).

    Google Scholar 

  • Tseytin G.S. (1991). Proceedings of 2nd Russian Logic Programming Conference (St. Petersburg). Lecture Notes in Computer Science.

    Google Scholar 

  • Warren D.H.D. (1977). Implementing Prolog — Compiling predicate logic programs. Rep. 39 and 40, University of Edinburgh, Scotland, May 1977.

    Google Scholar 

  • Warren D.H.D. (1983). An abstract Prolog instruction set. Tech. Note 309, SRI International, Menlo Park, Calif., Oct.1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voinov, A.V. (1992). Netlog — A concept oriented logic programming language. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013074

Download citation

  • DOI: https://doi.org/10.1007/BFb0013074

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55727-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics