Universal Unification and Regular Equational ACFM Theories
نویسندگان
چکیده
منابع مشابه
On Equational Theories, Unification and Decidability
The following classes of equational theories, which are important in unification theory, are presented: permutative, finite, Noetherian, simple, almost collapse free, collapse free, regular, and ~-free theories. The relationships between the particular theories are shown and the connection between these classes and the unification hierarchy is pointed out. We give an equational theory that alwa...
متن کاملOn Equational Theories, Unification, and (Un)Decidability
We investigate the following classes of equational theories which are important in unification theory: permutative, finite, Noetherian, simple, almost collapse free, collapse free, regular, and O-free theories. We show some relationships between the particular classes and their connections to the unification hierarchy. Especially, we study conditions, under which minimal and complete sets of un...
متن کاملThe Exact Unification Type of Commutative Theories
The exact unification type of an equational theory is based on a new preorder on substitutions, called the exactness preorder, which is tailored towards transferring decidability results for unification to disunification. We show that two important results regarding the unification type of commutative theories hold not only for the usual instantiation preorder, but also for the exactness preord...
متن کاملAsymmetric Unification and Disunification
We compare two kinds of unification problems: Asymmetric Unification and Disunification, which are variants of Equational Unification. Asymmetric Unification is a type of Equational Unification where the right-hand sides of the equations are in normal form with respect to the given term rewriting system. In Disunification we solve equations and disequations with respect to an equational theory....
متن کاملDisabling equational theories in unification for cryptographic protocol analysis through tagging
Most of the research on protocol security in the past two decades has been conducted assuming a free message algebra. However, operators such as Exclusive-OR (XOR) possess algebraic properties. There were instances when a protocol was secure in the free algebra, but insecure in the presence of equational theories induced by such operators [10]. Hence, it is important to conduct protocol analysi...
متن کامل