An algebraic approach to unification under associativity and commutativity
Proc. of the first international conference on Rewriting techniques and applications
Unification in datastructure multisets
Journal of Automated Reasoning
Automated deduction by theory resolution
Journal of Automated Reasoning
Complete sets of unifiers and matchers in equational theories
Theoretical Computer Science
A categorical unification algorithm
Proceedings of a tutorial and workshop on Category theory and computer programming
Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Unification under associativity and idempotence is of type nullary
Journal of Automated Reasoning
The theory of idempotent semigroups is of unification type zero
Journal of Automated Reasoning
Unification in commutative idempotent monoids
Theoretical Computer Science
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
Journal of Symbolic Computation
An extension of Buchberger's algorithm and calculationsin enveloping fields of lie algebras
Journal of Symbolic Computation
Journal of Symbolic Computation
Unification in commutative theories
Journal of Symbolic Computation
Non-commutative Gröbner bases in algebras of solvable type
Journal of Symbolic Computation
Unification in monoidal theories
CADE-10 Proceedings of the tenth international conference on Automated deduction
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
A Unification Algorithm for Associative-Commutative Functions
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
Automata, Languages, and Machines
Automata, Languages, and Machines
Semirings, Automata and Languages
Semirings, Automata and Languages
Groebner Bases for Non-Commutative Polynomial Rings
AAECC-3 Proceedings of the 3rd International Conference on Algebraic Algorithms and Error-Correcting Codes
Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings
EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Term Orderings on the Polynominal Ring
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Associative-Commutative Unification
Proceedings of the 7th International Conference on Automated Deduction
Unification Properties of Commutative Theories: A Categorical Treatment
Category Theory and Computer Science
A simplified proof of the characterization theorem for Gröbner-bases
ACM SIGSAM Bulletin
Solving linear equations over polynomial semirings
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Note: An undecidability result for AGh
Theoretical Computer Science
Permutative rewriting and unification
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and Computation
An E-unification algorithm for analyzing protocols that use modular exponentiation
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Deciding knowledge in security protocols for monoidal equational theories
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Decidability and Combination Results for Two Notions of Knowledge in Security Protocols
Journal of Automated Reasoning
| Hi-index | 0.01 |