Presentation 1994/1/20
Backward-chaining for Abduction
Isao Igarashi, Ikuo Tahara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Abduction is a logical inference that finds explanations of an observation that are consistent with knowledge.To make such inference fast,compilation methods were proposed so far,but there was a problem of an increase of compiled knowledge.We consider backward-chaining for the abuductive inference based on non- compiled knowledge. In the case of horn clauses,it is easy to realize abduction by backward-chaining.This paper proposes a method of backward- chaining abducfion for general clauses.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Backward-chaining / Abduction / Minimal Supports
Paper # AI93-76
Date of Issue

Conference Information
Committee AI
Conference Date 1994/1/20(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) Backward-chaining for Abduction
Sub Title (in English)
Keyword(1) Backward-chaining
Keyword(2) Abduction
Keyword(3) Minimal Supports
1st Author's Name Isao Igarashi
1st Author's Affiliation Faculty of Science and Technology,Science University of Tokyo()
2nd Author's Name Ikuo Tahara
2nd Author's Affiliation Faculty of Science and Technology,Science University of Tokyo
Date 1994/1/20
Paper # AI93-76
Volume (vol) vol.93
Number (no) 424
Page pp.pp.-
#Pages 8
Date of Issue