- 著者
-
赤間 清
繁田 良則
宮本 衛市
- 出版者
- 社団法人人工知能学会
- 雑誌
- 人工知能学会誌 (ISSN:09128085)
- 巻号頁・発行日
- vol.12, no.2, pp.266-275, 1997-03-01
- 被引用文献数
-
53
We propose a new framework for solving problems based on equivalent transformation of logic programs, where equivalent transformation is defined as changing programs preserving their declarative semantics. In the conventional logic programming, we (1) represent the knowledge in the given problem in terms of a logic program, (2) formalize the given problem as proving the given query from the knowledge, and (3) solve it in use of inference rules, such as resolution. In contrast, our new method does not use inference but equivalent transformation of logic programs. In the new method we (1) represent the knowledge together with the given query in the given problem as a logic program, (2) formalize the given problem as finding its equivalent logic program in a certain form, and (3) solve it by equivalent transformation of logic programs using equivalent transformation rules. Many problems, including the kind of problems which Prolog solves, are formalized and solved in the new method. The computational framework given here is called the Rule Based Equivalent Transformation (RBET). The validity of computation is strictly guaranteed by use of equivalent transformation rules, even if extralogical predicates are used in rules. Transformation rules are more expressive than Horn clauses in Prolog. RBET has the flexibility in the applications order of equivalent transformation rules, which makes efficient computation possible by the control of rule application based on rule preference.