Depth-Bounded Inference for Nonterminating Prologs - Collections

＜journal article＞
Depth-Bounded Inference for Nonterminating Prologs

Creator	Creator Name Arimura, Hiroki 有村, 博紀 Affiliation Affiliation Name Department of Artificial Intelligence Kyushu Institute of Technology 九州工業大学情報工学部知能情報工学科
Language	English
Publisher	Research Association of Statistical Sciences
Publisher	統計科学研究会
Date	1990-10-04
Date	1993-03
Source Title	Bulletin of informatics and cybernetics
Vol	25
Issue	3/4
First Page	125
Last Page	136
Publication Type	Version of Record
Access Rights	open access
Crossref DOI	https://doi.org/10.5109/3139
Related DOI	RIFIS Technical Report ; 31
Related DOI	RIFIS Technical Report \|\| 31
	Bulletin of informatics and cybernetics \|\| 25(3/4) \|\| p125-136
	http://bic.math.kyushu-u.ac.jp/
Related URI	RIFIS Technical Report \|\| 31
	Bulletin of informatics and cybernetics \|\| 25(3/4) \|\| p125-136
	http://bic.math.kyushu-u.ac.jp/
Relation	RIFIS Technical Report ; 31
	RIFIS Technical Report \|\| 31
	Bulletin of informatics and cybernetics \|\| 25(3/4) \|\| p125-136
	http://bic.math.kyushu-u.ac.jp/
Abstract	In this paper, we study the completeness of the depth-bounded resolution, which is an SLD-resolution that prunes infinite derivations using the depth-bound. We introduce a class of definite programs w...ith local variables, called linearly covering programs, and prove the completeness of the depth-bounded resolution for the class with respect to the CWA of Reiter.show more

File	FileType	Size	Views	Description
rifis-tr-31	pdf	935 KB	375	RIFIS Technical Report
p125	pdf	766 KB	188	Bulletin of Informatics and Cybernetics

PISSN	0286-522X
EISSN	2435-743X
NCID	AA10634475
Record ID	3139
Peer-Reviewed	Refereed
Notes	Former version: Termination properties of a subclass of ground I/O logic programs, October,1990
Created Date	2009.04.22
Modified Date	2020.10.22