Constraints in computational logics
Modular termination of context-sensitive rewriting
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A Tableau Calculus for Combining Non-disjoint Theories
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Deciding the Word Problem in the Union of Equational Theories Sharing Constructors
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
On modularity in infinitary term rewriting
Information and Computation
Integration Testing from Structured First-Order Specifications via Deduction Modulo
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On modularity in infinitary term rewriting
Information and Computation
Generalizing newman's lemma for left-linear rewrite systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Extension of first-order theories into trees
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Confluence of non-left-linear TRSs via relative termination
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Modularity in term rewriting revisited
Theoretical Computer Science
| Hi-index | 0.00 |