Presentation 1998/7/23
Overcoming the Difficulties of SLD Resolution
Kiyoshi Akama, Yuuichi Kawaguchi, Eiichi Miyamoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The theory of SLD resolution provides Prolog with a theoretical foundation. SLD resolution is, however, not the best way to solve logical problems. For instance, SLD resolution imposes some unnecessary restrictions on the control of computation. These restrictions make computation control more expensive and, conversely, adoption of low-cost control would make computation less flexible, as can be seen in the Prolog case. This paper adopts a new computation paradigm, called Equivalent Transformation paradigm, and overcomes the difficulties due to restrictions of SLD resolution.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) logic programming / equivalent transformation / unfolding / SLD resolution
Paper # OFS98-6,AI98-15
Date of Issue

Conference Information
Committee AI
Conference Date 1998/7/23(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Overcoming the Difficulties of SLD Resolution
Sub Title (in English)
Keyword(1) logic programming
Keyword(2) equivalent transformation
Keyword(3) unfolding
Keyword(4) SLD resolution
1st Author's Name Kiyoshi Akama
1st Author's Affiliation Division of System and Information Engineering, Hokkaido University()
2nd Author's Name Yuuichi Kawaguchi
2nd Author's Affiliation Division of System and Information Engineering, Hokkaido University
3rd Author's Name Eiichi Miyamoto
3rd Author's Affiliation Division of System and Information Engineering, Hokkaido University
Date 1998/7/23
Paper # OFS98-6,AI98-15
Volume (vol) vol.98
Number (no) 201
Page pp.pp.-
#Pages 8
Date of Issue