Edinburgh Research Explorer

Relational Rippling: a General Approach

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Related Edinburgh Organisations

Open Access permissions



Original languageEnglish
Title of host publicationProceedings of the Fourteenth International Joint Conference on Artificial Intelligence - IJCAI-95
Publication statusPublished - 1995


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].

    Research areas

  • Rippling, heuristics, inductive proofs, Automated theorem proving , logic program transformation

Download statistics

No data available

ID: 403674