Solved Forms for Path Ordering Constraints
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
The Theory of Total Unary RPO Is Decidable
CL '00 Proceedings of the First International Conference on Computational Logic
Invited Talk: Rewrite-based Deduction and Symbolic Constraints
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
CCE: Testing Ground Joinability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
On using ground joinable equations in equational theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
AI Communications - CASC
SAT solving for argument filterings
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Confluence of right ground term rewriting systems is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |