Interpreters • Transitional abstract interpreters: proceed by induction

An inductive proof scheme is given in BOBJ, using its higher order modules and higher order views. Views make parameterized programming more powerful and convenient , by tting actual parameters to formal parameters in a exible way.

Rule extraction is one of the main tasks in the Knowledge Discovery process. Our hypothesis is that the interestingness of rules is strongly related to statistical independence between facts. Human reasoning assumes by default statistical independence and when a rule breaks this assumption it is considered interesting. This fact has been noticed long ago and even proposed as a principle for rul...

A theorem of Mirsky provides necessary and sufficient conditions for the existence of an N-square complex matrix with prescribed diagonal entries and prescribed eigenvalues. A simple inductive proof of this theorem is given.

We present a unified parametrisation of `-blocks of quasi-simple finite groups of Lie type in non-defining characteristic via Lusztig’s induction functor in terms of eJordan-cuspidal pairs and e-Jordan quasi-central cuspidal pairs.

This paper presents a methodology for knowledge discovery from inherently distributed data without moving it from its original location, completely or partially, to other locations for legal or competition issues. It is based on a novel technique that performs in two stages: first, discovering the knowledge locally and second, merging the distributed knowledge acquired in every location in a co...