Rippling Heuristic
Jump to navigation
Jump to search
A Rippling Heuristic is a meta-level heuristic.
- See: Rewrite System, Automated Theorem Proving, Heuristics, Mathematical Induction, Automated Theorem Prover.
References
2023
- (Wikipedia, 2023) ⇒ https://en.wikipedia.org/wiki/Rippling Retrieved:2023-9-7.
- In computer science, more particularly in automated theorem proving, rippling refers to a group of meta-level heuristics, developed primarily in the Mathematical Reasoning Group in the School of Informatics at the University of Edinburgh, and most commonly used to guide inductive proofs in automated theorem proving systems. Rippling may be viewed as a restricted form of rewrite system, where special object level annotations are used to ensure fertilization upon the completion of rewriting, with a measure decreasing requirement ensuring termination for any set of rewrite rules and expression.