Termination for direct sums of left-linear complete term rewriting systems
Journal of the ACM (JACM)
Simplifying termination proofs for rewrite systems by preprocessing
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
On Completion of Constraint Handling Rules
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Tyrolean termination tool: Techniques and features
Information and Computation
An insertion operator preserving infinite reduction sequences
Mathematical Structures in Computer Science
Automated Reasoning in Kleene Algebra
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Modular Termination of Basic Narrowing
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Languages: From Formal to Natural
Combining induction axioms by machine
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Diagram Chase in Relational System Development
Electronic Notes in Theoretical Computer Science (ENTCS)
Automating algebraic methods in isabelle
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Inductive type schemas as functors
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Modularity in term rewriting revisited
Theoretical Computer Science
Jumping and escaping: Modular termination and the abstract path ordering
Theoretical Computer Science
Simplification Orderings: History Of Results
Fundamenta Informaticae
Hi-index | 0.00 |