Machine intelligence 11
Handbook of theoretical computer science (vol. B)
Semantic unification for convergent systems
Semantic unification for convergent systems
Calendrical calculations
Decidability and complexity analysis by basic paramodulation
Information and Computation
Higher-Order and Semantic Unification
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Complete Sets of Unifiers and Matchers in Equational Theories
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Some Termination Criteria for Narrowing and E-Narrowing
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Decidable Matching for Convergent Systems (Preliminary Version)
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Partial inversion of constructor term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Proving injectivity of functions via program inversion in term rewriting
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A grammar-based approach to invertible programs
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
We consider functions defined by ground-convergent leftlinear rewrite systems. By restricting the depth of left sides and disallowing defined symbols at the top of right sides, we obtain an algorithm for function inversion.