Abstract:
We generalize the notion of formula rewriting systems proposed in the prelim¬inary work, extend the class of such systems and expand our previous results for the new class. We demonstrate that the well-known techniques of formula simpli¬fication can be represented in terms of this formalism and investigate termination problem for such systems in detail.
Keywords:
Issue
Pages:
1-18
File:
anureev_7.pdf
(7.7 MB)