Best-First rippling

  • Authors:

  • Moa Johansson;Alan Bundy;Lucas Dixon

  • Affiliations:

  • School of Informatics, University of Edinburgh, Edinburgh, UK;School of Informatics, University of Edinburgh, Edinburgh, UK;School of Informatics, University of Edinburgh, Edinburgh, UK

  • Venue:
  • Reasoning, Action and Interaction in AI Theories and Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rippling is a form of rewriting that guides search by only performing steps that reduce the differences between formulae. Termination is normally ensured by a defined measure that is required to decrease with each step. Because of these restrictions, rippling will fail to prove theorems about, for example, mutual recursion where steps that temporarily increase the differences are necessary. Best-first rippling is an extension to rippling where the restrictions have been recast as heuristic scores for use in best-first search. If nothing better is available, previously illegal steps can be considered, making best-first rippling more flexible than ordinary rippling. We have implemented best-first rippling in the IsaPlanner system together with a mechanism for caching proof-states that helps remove symmetries in the search space, and machinery to ensure termination based on term embeddings. Our experiments show that the implementation of best-first rippling is faster on average than IsaPlanner's version of traditional depth-first rippling, and solves a range of problems where ordinary rippling fails.