Refutational theorem proving using term-rewriting systems
Artificial Intelligence
Sufficient completeness, term rewriting systems and “anti-unification”
Proc. of the 8th international conference on Automated deduction
Unification in combinations of collapse-free theories with disjoint sets of function symbols
Proc. of the 8th international conference on Automated deduction
Proc. of the 8th international conference on Automated deduction
Matching, unification and complexity
ACM SIGSAM Bulletin
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
Embedding boolean expressions into logic programming
Journal of Symbolic Computation
Journal of Automated Reasoning
Journal of Symbolic Computation
Boolean unification - The story so far
Journal of Symbolic Computation
An overview of LP, the larch power
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Unification in a Combination of Arbitrary Disjoint Equational Theories
Proceedings of the 9th International Conference on Automated Deduction
Discriminator varieties and symbolic computation
Journal of Symbolic Computation
Note: An assertion concerning functionally complete algebras and NP-completeness
Theoretical Computer Science
The unification type of the Pythagorean equation in varieties of nilpotent rings
Journal of Symbolic Computation
On the equality of probabilistic terms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Hi-index | 0.01 |
This paper examines the unification problem in the class of primal algebras and the varieties they generate. An algebra is called primal if every function on its carrier can be expressed just in terms of the basic operations of the algebra. The two-element Boolean algebra is the simplest nontrivial example: Every truth-function can be realized in terms of the basic connectives, for example, negation and conjunction.It is shown that unification in primal algebras is unitary, that is, if an equation has a solution, it has a single most general one. Two unification algorithms, based on equation-solving techniques for Boolean algebras due to Boole and Lo¨wenheim, are studied in detail. Applications include certain finite Post algebras and matrix rings over finite fields. The former are algebraic models for many-valued logics, the latter cover in particular modular arithmetic.Then unification is extended from primal algebras to their direct powers, which leads to unitary unification algorithms covering finite Post algebras, finite, semisimple Artinian rings, and finite, semisimple nonabelian groups.Finally the fact that the variety generated by a primal algebra coincides with the class of its subdirect powers is used. This yields unitary unification algorithms for the equational theories of Post algebras and p-rings.