Relational Rippling: A General Approach
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 175-180.
Abstract
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].
@inproceedings{ijcai1995p23,
title = {Relational Rippling: A General Approach},
author = {Bundy, Alan and Lombart, Vincent},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {175--180},
year = {1995},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1995/23},
}
TY - CPAPER TI - Relational Rippling: A General Approach AU - Bundy, Alan AU - Lombart, Vincent T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 175 EP - 180 UR - https://ijcai.org/proceedings/1995/23 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: