Authors:
Tadayuki Yoshida
1
;
Ekawit Nantajeewarawat
2
;
Masaharu Munetomo
3
and
Kiyoshi Akama
3
Affiliations:
1
Tokyo Software Development Laboratory, International Business Machines Corporation, Tokyo and Japan
;
2
Computer Science Program, Sirindhorn International Institute of Technology Thammasat University, Pathumthani and Thailand
;
3
Information Initiative Center, Hokkaido University, Sapporo and Japan
Keyword(s):
Term Rewriting Rules, Logical Problem Solving Framework, Equivalent Transformation, Correctness.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Communication and Software Technologies and Architectures
;
e-Business
;
Enterprise Information Systems
;
Knowledge Engineering
;
Knowledge Engineering and Ontology Development
;
Knowledge Representation
;
Knowledge-Based Systems
;
Symbolic Systems
Abstract:
Term rewriting is often used for proving theorems. To mechanizing such a proof method with computation correctness guaranteed strictly, we follow LPSF, which is a general framework for generating logical problem solution methods. In place of the first-order logic, we use KR-logic, which has function variables, for correct formalization. By repeating (1) specialization by a substitution for usual variables, and (2) application of an already derived rewriting rule, we can generate a term rewriting rule from the resulting equational clause. The obtained term rewriting rules are proved to be equivalent transformation rules. The correctness of the computation results is guaranteed. This theory shows that LPSF integrates logical inference and functional rewriting under the broader concept of equivalent transformation.