An overview of Rewrite Rule Laboratory (RRL)

Computers and Mathematics with Applications

Volumn 29, Issue 2, 1995, Pages 91-114

  Kapur, D ^a   Zhang, H ^b  

^a STATE UNIVERSITY OF NEW YORK   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Discrimination nets; Equational logic; Rewrite techniques; RRL

Indexed keywords

EID: 0003197380     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/0898-1221(94)00218-A     Document Type: Article

References (68)

1. RRL: A Rewrite Rule Laboratory
2. RRL: A Rewrite Rule Laboratory
3. FRI: Failure Resistant Induction in RRL
4. Herky: High-performance rewriting techniques in RRL
5. An overview of RRL: Rewrite Rule Laboratory
6. Tecton proof system
7. Architecture of and experiments with RRL, a Rewrite Rule Laboratory
8. Simple word problems in universal algebras
9. Tecton proof system
10. Termination of rewriting
11. Only prime superpositions need be considered for the Knuth-Bendix completion procedure
12. Unnecessary inferences in associative-commutative completion procedures
13. Matching, unification and complexity
14. Complexity of matching problems
15. Complexity of unification problems with associative-commutative operators
16. Double-exponential complexity of computing a complete set of AC-unifiers
17. An equational approach to theorem proving in first-order predicate calculus
18. First-order logic theorem proving using conditional rewrite rules
19. Proof by induction using test sets
20. A mechanizable induction principle for equational specifications
21. Sufficient-completeness, quasi-reducibility and their complexity
22. A case study of completion modulo distributivity and Abelian groups
23. On proving inductive properties of abstract data types
24. Proof by consistency
25. A new method for proving termination of AC-rewrite systems
26. Proving equivalence of different axiomatizations of free groups
27. Decision Procedures for Simple Equational Theories with Commutative-Associative Axioms: Complete Sets of Commutative-Associative Reductions
28. Complete sets of reductions for some equational theories
29. Fast Knuth-Bendix completion: Summary
30. The refutational completeness of blocked permutative narrowing and resolution
31. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm
32. Inductive completion by ground proof transformation
33. Complete sets of reductions with constraints
34. Automated proofs of the Moufang identities in alternative rings
35. A new strategy for the Boolean ring based approach to first order theorem proving
36. Refutational theorem proving using term-rewriting systems
37. Proving group isomorphism theorems: A case study of conditional completion
38. Implementing contextual rewriting
39. Automatic proofs by induction in equational theories without constructors
40. How to prove algebraic inductive hypotheses without induction
41. Proofs by induction in equational theories with constructors
42. Automating induction: Explicit vs. inductionless
43. Hardware verification in the Interactive VHDL workstation
44. Formal verification of the Sobel image processing chip
45. Formal Verification of Circuit Designs in VHDL
46. Formal semantics of VHDL for verification of circuit designs
47. Axiomatic semantics of a hardware specification language
48. Using algebraic specifications in Floyd-Hoare assertions
49. Tecton: A framework for specifying and verifying generic system components
50. The AFFIRM theorem prover: Proof forests and management of large proofs
51. 3 = x implies ring commutativity
52. Canonicalization and demodulation
53. Case studies of Z-module reasoning: Proving benchmark theorems for ring theory
54. Automated proof of ring commutativity problems by algebraic methods
55. Automated proofs of equality problems in Overbeek's competition
56. Reduction, superposition and induction: Automated reasoning in an equational logic
57. Proving Ramsey theorem by the cover set induction: A case and comparison study
58. Proving the Chinese remainder theorem by the cover ste induction
59. On sufficient completeness and related properties of term rewriting systems
60. Automating inductionless induction by test sets
61. RRL: A Rewrite Rule Laboratory--User's Manual