Rippling is a radically new technique for the automation of mathematical reasoning. It is widely applicable whenever a goal is to be proved from one or more syntactically similar givens. It was originally developed for inductive proofs, where the goal was the induction conclusion and the givens were the induction hypotheses. It has proved to be applicable to a much wider class of tasks, from summing series via analysis to general equational reasoning. The application to induction has especially important practical implications in the building of dependable IT systems, and provides solutions to issues such as the problem of combinatorial explosion. Rippling is the first of many new search control techniques based on formula annotation; some additional annotated reasoning techniques are also described here. This systematic and comprehensive introduction to rippling, and to the wider subject of automated inductive theorem proving, will be welcomed by researchers and graduate students alike.
We describe ORS, an ontology repair system. In contrast to most ontology matching systems, ORS is designed to repair an ontology that does not accurately model its domain. ORS’s ontology repairs include belief revisions, but more often makes signature repairs. It does not require full access to the ontologies of other agents and works entirely automatically and dynamically. ORS is the first example of a new breed of dynamic, automatic ontology-repair mechanisms, which we believe will be essential to realise the vision of autonomous, interacting agents, such as envisaged in the emantic Web. Full access to another (potentially rival) agent’s ontology is unrealistic; static and interactive matching mechanisms are unrealistic in the context of huge, dynamic populations of agents and full ontological agreement is pragmatically unrealistic. We present encouraging experimental results, plus an analysis of current limitations to be addressed in future work.