Presentation	1998/7/30 A Theoretical Foundation for Solving Logical Problems by Equivalent Transformation ,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In logic programming, computation is regarded as inference. Given a logic program P and a query q, Prolog fings substitutions θ such that P⊧qθ in terms of inference. It is widely believed that inference is the unique and best way to solve logical problems. In this paper, equivalent transformation is proposed as a new method for solving logical problems without relying on inferential methods. In the new method, a logic program is transformed equivalently to a simpler form, preserving its declarative semantics and utilizing many transformation rules.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	logic programming / logical problem / declarative semantics / equivalent transformation
Paper #	SS98-14
Date of Issue

Conference Information
Committee	SS
Conference Date	1998/7/30(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)	A Theoretical Foundation for Solving Logical Problems by Equivalent Transformation
Sub Title (in English)
Keyword(1)	logic programming
Keyword(2)	logical problem
Keyword(3)	declarative semantics
Keyword(4)	equivalent transformation
1st Author's Name
1st Author's Affiliation	Division of System and Information Engineering, Hokkaido University()
Date	1998/7/30
Paper #	SS98-14
Volume (vol)	vol.98
Number (no)	229
Page	pp.pp.-
#Pages	8
Date of Issue