Elementary Formal System as a Logic Programming Language - Collections

＜technical report＞
Elementary Formal System as a Logic Programming Language

Creator	Creator Name Yamamoto, Akihiro 山本, 章博 Affiliation Affiliation Name Department of Information Systems Kyushu University 九州大学大学院総合理工学研究科情報システム学専攻
Language	English
Publisher	Research Institute of Fundamental Information Science, Kyushu University
Publisher	九州大学理学部附属基礎情報学研究施設
Date	1989-03-05
Source Title	RIFIS Technical Report
Vol	12
Publication Type	Accepted Manuscript
Access Rights	open access
Related DOI	RIFIS Technical Report \|\| 12 \|\| p1-16
Related DOI	http://www.i.kyushu-u.ac.jp/research/report.html
Related URI	RIFIS Technical Report \|\| 12 \|\| p1-16
Related URI	http://www.i.kyushu-u.ac.jp/research/report.html
Relation	RIFIS Technical Report \|\| 12 \|\| p1-16
Relation	http://www.i.kyushu-u.ac.jp/research/report.html
Abstract	In this paper, we give a theoretical foundation of EFS (elementary formal system) as a logic programming language. We show that the set of ail the unifiers of two atoms is finite and computable by res...tricting the form of axioms and goals without losing generality. The restriction makes the negation as failure rule complete. We give two conditions of EFS's such that the negation as failure rule is identical to the closed world assumption. We also give a subclass of EFS's where a procedure of CWA is given as bounding the length of derivations We compare these classes with the Chomsky hierarchy.show more

File	FileType	Size	Views	Description
rifis-tr-12	pdf	1.75 MB	524

Record ID	3118
Peer-Reviewed	Unrefereed
Notes	Proc. Logic Programming Conference 1989, 123-132
Type	テクニカルレポート
Created Date	2009.04.22
Modified Date	2017.01.20