Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
Equational theory of context unification is undecidable
Theoretical Computer Science
The Constraint Language for Lambda Structures
Journal of Logic, Language and Information
Dominance Constraints in Context Unification
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A New Result about the Decidability of the Existential One-Step Rewriting Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Weakly Regular Relations 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
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
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
Constraints over Lambda-Structures in semantic underspecification
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
The Existential Fragment of the One-Step Parallel Rewriting Theory
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Context unification with one context variable
Journal of Symbolic Computation
Decidability of bounded higher-order unification
Journal of Symbolic Computation
Deciding satisfiability of positive second order joinability formulae
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |