The first-order theory of subtyping constraints
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding the confluence of ordered term rewrite systems
ACM Transactions on Computational Logic (TOCL)
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
The Theory of Total Unary RPO Is Decidable
CL '00 Proceedings of the First International Conference on Computational Logic
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Knuth--bendix constraint solving is NP-complete
ACM Transactions on Computational Logic (TOCL)
The decidability of the first-order theory of knuth-bendix order
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Tractable inference systems: an extension with a deducibility predicate
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 5.23 |