An algorithm for finding canonical sets of ground rewrite rules in polynomial time
Journal of the ACM (JACM)
On Lexicographic Termination Ordering with Space Bound Certifications
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Orienting rewrite rules with the Knuth--Bendix order
Information and Computation - RTA 2001
Knuth--bendix constraint solving is NP-complete
ACM Transactions on Computational Logic (TOCL)
Termination of String Rewriting Proved Automatically
Journal of Automated Reasoning
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Proving Termination with (Boolean) Satisfaction
Logic-Based Program Synthesis and Transformation
Quasi-interpretations a way to control resources
Theoretical Computer Science
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Solving partial order constraints for LPO termination
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
Journal of Automated Reasoning
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
Simplification Orderings: History Of Results
Fundamenta Informaticae
| Hi-index | 5.23 |