Completeness of Extended Unification Based on Basic Narrowing - Collections

＜technical report＞
Completeness of Extended Unification Based on Basic Narrowing

Creator	Creator Name Yamamoto, Akihiro 山本, 章博 Affiliation Affiliation Name Department of Information Systems Interdisciplinary Graduate School of Engineering Sciences Kyushu University 九州大学大学院総合理工学研究科情報システム学専攻
Language	English
Publisher	Research Institute of Fundamental Information Science, Kyushu University
Publisher	九州大学理学部附属基礎情報学研究施設
Date	1988-03-19
Source Title	RIFIS Technical Report
Vol	2
Publication Type	Accepted Manuscript
Access Rights	open access
Related DOI	RIFIS Technical Report \|\| 2 \|\| p2-10
Related DOI	http://www.i.kyushu-u.ac.jp/research/report.html
Related URI	RIFIS Technical Report \|\| 2 \|\| p2-10
Related URI	http://www.i.kyushu-u.ac.jp/research/report.html
Relation	RIFIS Technical Report \|\| 2 \|\| p2-10
Relation	http://www.i.kyushu-u.ac.jp/research/report.html
Abstract	In this paper we prove the completeness of unification based on the basic narrowing. first we prove the completeness of unification based on original narrowing under a weaker condition than the previo...us proof. Then we discuss the relation between basic narrowing and innermost reduction as the lifting lemma, and prove the completeness of unification based on the basic narrowing. Moreover, we give the switching lemma to combine the previous algorithm and our new proof.show more

File	FileType	Size	Views	Description
rifis-tr-2	pdf	977 KB	431

Record ID	3108
Peer-Reviewed	Unrefereed
Notes	Lecture Notes in Artificial Intelligence 383, 1-10, 1989
Type	テクニカルレポート
Created Date	2009.04.22
Modified Date	2017.01.20