Inheritance hierarchy mechanism in prolog
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.
KeywordsExecution Time Exhaustive Search Term Description Class Constraint Combinatorial Explosion
Unable to display preview. Download preview PDF.
- Frisch AM (1985) An Investigation into Inference with Restricted Quantification and a Taxonomic Representation, SIGART Newsletter, 91: 28–31Google Scholar
- Giannesini F, Kanoui H, Pasero R, van Caneghem M (1985) Prolog (in French). InterEditions, ParisGoogle Scholar
- Koyama H, Tanaka H (1985) Definite Clause Knowledge Representation (in Japanese), proc. of the Logic Programming Conference '85, 95–106Google Scholar
- Nakashima H (1986) Uranus Reference Manual, Research Memorandum, ETL-RM-86-7. Electrotechnical Laboratory, Ibaraki JAPANGoogle Scholar
- Nakashima H (1985) Term Description: A Simple Powerful Extension to Prolog Data Structures, Proc. of IJCAI-IX, 708–710Google Scholar
- Shibayama E (1984) Extension of Unification in Logic Programming and its Applications (in Japanese), WG. of Software foundation, 10–4, 31–40Google Scholar
- Tomura S (1985) TDProlog: An Extended Prolog with Term Description (in Japanese), Proc. of the Logic Programming Conference '85, 237–245Google Scholar