THE ALGEBRAIC INTERPRETATION OF CONDITIONAL REWRITE SYSTEMS ON THE BASIS OF LP STRUCTURES
The theory of rewrite systems is an effective tool for solving a number of important problems of artificial intelligence and computer algebra. This paper introduces an algebraic system with the semantics of a set of rules of conditional equational theory, or a conditional term rewriting system. For the given model such issues as closure, equivalent transformations, the structure of closure, and logical reduction are addressed. The obtained results can be applied to analysis and automatic optimization of the corresponding set of rules.