Abstract In the rule-based equivalent transformation (RBET) paradigm, where computation is based on meaning-preserving transformation of declarative descriptions, a set of rewriting rules is regarded as a program. The syntax for a large class of rewriting rules is determined. The incorporation of meta-variables of two different kinds enables precise control of rewriting-rule instantiations. As a result, the applicability of rewriting rules and the results of rule applications can be rigorously specified. A theoretical basis for justifying the correctness of rewriting rules is established. Reverse transformation operation in the RBET framework is discussed, and it is shown that a correct rewriting rule is reversible, i.e., a correct rewriting rule can in general be constructed by syntactically reversing another correct rewriting rule.
[1]
Gopalan Nadathur,et al.
Proof Procedures for Logic Programming
,
1994
.
[2]
J. A. Robinson,et al.
A Machine-Oriented Logic Based on the Resolution Principle
,
1965,
JACM.
[3]
Alberto Pettorossi,et al.
Transformation of Logic Programs
,
1994
.
[4]
J. Lloyd.
Foundations of Logic Programming
,
1984,
Symbolic Computation.
[5]
Dov M. Gabbay,et al.
Handbook of logic in artificial intelligence and logic programming (vol. 1)
,
1993
.
[6]
Alberto Pettorossi,et al.
Transformation of Logic Programs: Foundations and Techniques
,
1994,
J. Log. Program..