Presentation 2003/7/25
General Unification Theorey
MASATERU Harao,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Unification is a procedure of computing identities among symbolized informations, and is a most essential processing mechanism in knowledge processing. In this paper, I survey the characteristics of unification theories in various formal systems, and discuss the problems for extending the unification theory in intelligent processings.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) unification / matching / formal language / formulae / data structure / retrieval / equality / analogy / symbolic computation / reasoning / higher order anguage / computability / computational complexity
Paper # AI2003-23
Date of Issue

Conference Information
Committee AI
Conference Date 2003/7/25(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) General Unification Theorey
Sub Title (in English)
Keyword(1) unification
Keyword(2) matching
Keyword(3) formal language
Keyword(4) formulae
Keyword(5) data structure
Keyword(6) retrieval
Keyword(7) equality
Keyword(8) analogy
Keyword(9) symbolic computation
Keyword(10) reasoning
Keyword(11) higher order anguage
Keyword(12) computability
Keyword(13) computational complexity
1st Author's Name MASATERU Harao
1st Author's Affiliation Faculty of Computer Science and Systems Engineering, Kyushu Institute of Technology()
Date 2003/7/25
Paper # AI2003-23
Volume (vol) vol.103
Number (no) 244
Page pp.pp.-
#Pages 6
Date of Issue