Presentation 1997/9/18
Solving "No-solution" Problems based on Homomorphism Theorem of Logic Programs
Kiyoshi Akama, Hiroshi Mabuchi, Eiichi Miyamoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Complicated problems are often solved by their simplification into more manageable abstract problems, the solution of which yields information about the original problem. The proposed theory lays a foundation for such a technique to solve "no-solution" problems in logic programming. The new theory is based on the concept of a homomorphism, which maps a concrete logic program into an abstract one. A homomorphism theorem establishes a relationship between the declarative semantics of such programs, which is used to prove the correctness of the proposed abstraction, method for "no-solution" problems.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) abstraction / declarative semantics / homomorphism theorem / logic programming
Paper # SS97-23
Date of Issue

Conference Information
Committee SS
Conference Date 1997/9/18(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 Software Science (SS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Solving "No-solution" Problems based on Homomorphism Theorem of Logic Programs
Sub Title (in English)
Keyword(1) abstraction
Keyword(2) declarative semantics
Keyword(3) homomorphism theorem
Keyword(4) logic programming
1st Author's Name Kiyoshi Akama
1st Author's Affiliation Division of System and Information Engineering, Hokkaido University()
2nd Author's Name Hiroshi Mabuchi
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 1997/9/18
Paper # SS97-23
Volume (vol) vol.97
Number (no) 260
Page pp.pp.-
#Pages 8
Date of Issue