This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Abstract. In the last years, extending OLAP (On-Line Analytical Processing) systems with spatial and temporal features has attracted the attention of of the GIS (Geographic Informa...
The critical functionality of many software applications relies on code that performs mathematically complex computations. However, such code is often difficult to test owing to t...
The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing norma...