Combining unification algorithms for confined regular equational theories
Proc. of the first international conference on Rewriting techniques and applications
On the Church-Rosser property for the direct sum of term rewriting systems
Journal of the ACM (JACM)
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
Associative-commutative unification
Journal of Symbolic Computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
A General Complete E-Unification Procedure
RTA '87 Proceedings of the 2nd International Conference on Rewriting Techniques and Applications
Characterization of Unification Type Zero
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
A short survey on the state of the art in matching and unification problems
ACM SIGSAM Bulletin
Constraints in computational logics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Tactics for reasoning modulo AC in coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
| Hi-index | 0.00 |
A general framework for unification in ''commutative'' theories is investigated which is based on a categorical reformulation of theory unification. We thus obtain the well-known results for abelian groups, abelian monoids and idempotent abelian monoids ...