Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
Equational theory of context unification is undecidable
Theoretical Computer Science
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Context Unification and Traversal Equations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Currying Second-Order Unification Problems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Stratified Context Unification Is in PSPACE
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Decidability of Bounded Higher-Order Unification
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Solvability of Context Equations with Two Context Variables is Decidable
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Decidability of bounded second order unification
Information and Computation
Deciding security of protocols against off-line guessing attacks
Proceedings of the 12th ACM conference on Computer and communications security
Nominal Unification from a Higher-Order Perspective
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
The Existential Fragment of the One-Step Parallel Rewriting Theory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Decidability of bounded higher-order unification
Journal of Symbolic Computation
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Describing lambda terms in context unification
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Nominal Unification from a Higher-Order Perspective
ACM Transactions on Computational Logic (TOCL)
Bounded second-order unification is NP-complete
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.01 |