On the Connections between Rewriting and Formal Language Theory
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Intersection of finitely generated congruences over term algebra
Theoretical Computer Science
Term rewriting restricted to ground terms
Theoretical Computer Science
Note: on ground tree transformations and congruences induced by tree automata
Theoretical Computer Science
Journal of Automated Reasoning
The Ground Tree Transducer Game with Identical Tree Automata
Fundamenta Informaticae
Deterministic bottom-up tree transducers and ground term rewrite systems
Theoretical Computer Science
On Deciding Satisfiability by DPLL($\Gamma+{\mathcal T}$) and Unsound Theorem Proving
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Congruences Generated by Extended Ground Term Rewrite Systems
Fundamenta Informaticae
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
Journal of Automated Reasoning
Congruence closure of compressed terms in polynomial time
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Congruences Generated by Extended Ground Term Rewrite Systems
Fundamenta Informaticae
The Ground Tree Transducer Game with Identical Tree Automata
Fundamenta Informaticae
The Ground Tree Transducer Game
Fundamenta Informaticae
Simple and Minimal Ground Term Equation Systems
Fundamenta Informaticae
| Hi-index | 0.00 |