Proc. of the first international conference on Rewriting techniques and applications
Unification problems with one-sided distributivity
Proc. of the first international conference on Rewriting techniques and applications
Complexity of matching problems
Proc. of the first international conference on Rewriting techniques and applications
Matching, unification and complexity
ACM SIGSAM Bulletin
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
NP-Completeness of the Set Unification and Matching Problems
Proceedings of the 8th International Conference on Automated Deduction
Complexity of Finitely Presented Algebras
Complexity of Finitely Presented Algebras
Matching, unification and complexity
ACM SIGSAM Bulletin
Unification in primal algebras, their powers and their varieties
Journal of the ACM (JACM)
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties
Theoretical Computer Science - Automated reasoning for security protocol analysis
Methodological Review: User-centered semantic harmonization: A case study
Journal of Biomedical Informatics
Variant Narrowing and Equational Unification
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Pattern matching and unification are two key primitive operations used in many inference based systems including theorem provers, term rewriting systems, computer algebra systems, deductive data bases, Prolog, logic programming systems, functional language systems, systems for analysis of specifications and program synthesis, and program verification systems. In this note, we give results recently obtained in studying the complexity of matching and unification problems for first-order terms especially when some function symbols are interpreted. For further details and proofs, the reader may wish to refer to a forthcoming paper by the authors.