Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Inheritance hierarchy mechanism in prolog

  • Conference paper
  • First Online:
Logic Programming '86 (LP 1986)

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

Included in the following conference series:

Abstract

PAL is an extended prolog to deal with inheritance hierarchy (IH). It adopts new patterns called class bound variables (CBVs). CBVs are different from variables with constraints in existing prolog systems, such as variables with "frozen" goals in prolog-II and term descriptions, in that class constraints of CBVs change in the inference when they are unified with other CBVs. The unification is efficiently executed by using the restriction on the IH structure, such as the exclusiveness among brother classes in IH. CBVs and the fast unification method improve the inferential efficiency greatly by suppressing combinatorial explosions, which might be caused by exhaustive searches in the inference in other systems.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Frisch AM (1985) An Investigation into Inference with Restricted Quantification and a Taxonomic Representation, SIGART Newsletter, 91: 28–31

    Google Scholar 

  • Giannesini F, Kanoui H, Pasero R, van Caneghem M (1985) Prolog (in French). InterEditions, Paris

    Google Scholar 

  • Koyama H, Tanaka H (1985) Definite Clause Knowledge Representation (in Japanese), proc. of the Logic Programming Conference '85, 95–106

    Google Scholar 

  • Nakashima H (1986) Uranus Reference Manual, Research Memorandum, ETL-RM-86-7. Electrotechnical Laboratory, Ibaraki JAPAN

    Google Scholar 

  • Nakashima H (1985) Term Description: A Simple Powerful Extension to Prolog Data Structures, Proc. of IJCAI-IX, 708–710

    Google Scholar 

  • Shibayama E (1984) Extension of Unification in Logic Programming and its Applications (in Japanese), WG. of Software foundation, 10–4, 31–40

    Google Scholar 

  • Tomura S (1985) TDProlog: An Extended Prolog with Term Description (in Japanese), Proc. of the Logic Programming Conference '85, 237–245

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Behavioral Science, Faculty of Letters, Hokkaido University, 060, Sapporo-shi, Japan

    Kiyoshi Akama

Authors
  1. Kiyoshi Akama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eiiti Wada

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akama, K. (1987). Inheritance hierarchy mechanism in prolog. In: Wada, E. (eds) Logic Programming '86. LP 1986. Lecture Notes in Computer Science, vol 264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18024-9_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-18024-9_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18024-1

  • Online ISBN: 978-3-540-47712-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation