Multi-level LP-Structures in Rewriting Systems

Abstract

An algebraic system containing the semantics of a set of rules of the conditional equational theory (or the conditional term rewriting system) is introduced. The following basic questions are considered for the given model: existence of logical closure, equivalent transformations, construction of logical reduction. The obtained results can be applied to analysis and automatic optimization of the corresponding set of rules.