Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
Dominance Constraints in Context Unification
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Higher Order Unification 30 Years Later
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Context Unification and Traversal Equations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
A Decidable Variant of Higher Order Matching
RTA '02 Proceedings of the 13th 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
Solvability of Context Equations with Two Context Variables is Decidable
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Higher-order unification and matching
Handbook of automated reasoning
Decidability of bounded second order unification
Information and Computation
A uniform approach to underspecification and parallelism
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Dominance constraints in stratified context unification
Information Processing Letters
On the relation between Context and Sequence Unification
Journal of Symbolic Computation
Context unification with one context variable
Journal of Symbolic Computation
Decidability of bounded higher-order unification
Journal of Symbolic Computation
On the complexity of higher-order matching in the linear λ-calculus
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Tractable and intractable second-order matching problems
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Sequence unification through currying
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Well-nested context unification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Higher-order matching in the linear lambda calculus in the absence of constants is NP-complete
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Describing lambda terms in context unification
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Hi-index | 0.00 |