Observational proofs by rewriting
Theoretical Computer Science
Test Sets for the Universal and Existential Closure of Regular Tree Languages
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Ground reducibility is EXPTIME-complete
Information and Computation
Computing constructor forms with non terminating rewrite programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
"Term partition" for mathematical induction
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Superposition for fixed domains
ACM Transactions on Computational Logic (TOCL)
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Narrowing, abstraction and constraints for proving properties of reduction relations
Rewriting Computation and Proof
| Hi-index | 0.00 |