Rippling: a heuristic for guiding inductive proofs
Artificial Intelligence
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
Proceedings of the 10th International Conference on Automated Deduction
Relational rippling: a general approach
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Invariant Discovery via Failed Proof Attempts
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Relational rippling: a general approach
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
White-box testing by combining deduction-based specification extraction and black-box testing
TAP'07 Proceedings of the 1st international conference on Tests and proofs
| Hi-index | 0.00 |
We propose a new version of rippling, called relational rippling. Rippling is a heuristic for guiding proof search, especially in the step cases of inductive proofs. Relational rippling is designed for representations in which value passing is by shared existential variables, as opposed to function nesting. Thus relational rippling can be used to guide reasoning about logic programs or circuits represented as relations. We give an informal motivation and introduction to relational rippling. More details, including formal definitions and termination proofs can be found in the longer version of this paper, [Bundy and Lombart, 1995].