Presentation 1996/1/18
Consideration about the Constructive Inductive Logic Programming
Takeshi NIITSU, Yoshifumi UKITA, Toshiyasu MATSUSHIMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Inverse Resolution and Inverse Implication have been proposed for learning a hypothesis with theoretical term constructively. Since Inverse Implication makes a random selection at first, it must repeat the selection until machine gets a necessary pair of instances. In this paper, we propose a new method of constructing a necessary by changing one instance of the firstly given pair with a query. And by restricting hypothesis space we show that we can construct a hypothesis which is consistent with given instances with membership query.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Inverse Implication / theoretical term / query
Paper # AI95-47
Date of Issue

Conference Information
Committee AI
Conference Date 1996/1/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 Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Consideration about the Constructive Inductive Logic Programming
Sub Title (in English)
Keyword(1) Inverse Implication
Keyword(2) theoretical term
Keyword(3) query
1st Author's Name Takeshi NIITSU
1st Author's Affiliation School of Science and Engineering, Waseda University()
2nd Author's Name Yoshifumi UKITA
2nd Author's Affiliation School of Science and Engineering, Waseda University
3rd Author's Name Toshiyasu MATSUSHIMA
3rd Author's Affiliation School of Science and Engineering, Waseda University
Date 1996/1/18
Paper # AI95-47
Volume (vol) vol.95
Number (no) 460
Page pp.pp.-
#Pages 6
Date of Issue