CF-induction is a sound and complete procedure for finding hypotheses in full clausal theories. It is based on the principle of Inverse Entailment (IE), and consists of two procedures: construction of a bridge theory and generalization of it. There are two possible ways to realize the generalization task in CF-induction. The one uses a single deductive operator, called γ-operator, and the other...

In this extended abstract we report on results recently achieved for answering instance queries relaxed by concept similarity measures [4]. Traditionally, Description Logic (DL) reasoning systems only support crisp inference services, like subsumption and instances queries. The latter can be effectively used to perform different types of search tasks: Given an ABox describing a set of individua...

ILP systems which use some form of Inverse Entailment (IE) are based on clause refinement through a hypotheses space bounded by a most specific clause. In this paper we give a new analysis of refinement operators in this setting. In particular, Progol’s refinement operator is revisited and discussed. It is known that Progol’s refinement operator is incomplete with respect to the general subsump...

This technical report presents an environment representation for use in vision-based navigation. The representation has two useful properties: 1) it has constant size, which can enable strong run-time guarantees to be made for control algorithms using it, and 2) it is structurally similar to a camera image space, which effectively allows control to operate in the sensor space rather than employ...

We outline a model of one-dimensional reasoning on interval relations with quantitative and qualitative distances. At the core of this model lie constraints on interval boundaries, partial ordering and subsumption relations on interval relations and interval boundary constraints, and the transformation of interval relations to interval boundary constraints and vice versa. By way of subsumption ...

Knowledge of which words are able to ll particular argument slots of a predicate can be used for structural disambiguation. This paper describes a proposal for acquiring such knowledge, and in line with much of the recent work in this area, a probabilistic approach is taken. We develop a novel way of using a semantic hierarchy to estimate the probabilities, and demonstrate the general approach ...

Learning classifier systems have previously been shown to have some application in single-step tasks with the generic features typically found in problems addressed by an Interactive Evolutionary Design process. This paper extends work in the area by applying the classifier system to progressively more complex multi-modal test environments. Analysis of the XCSR classifier system is made with re...

In this paper, we are interested in the analysis of sequential data and we propose an original framework based on FCA. For that, we introduce sequential pattern structures, an original specification of pattern structures for dealing with sequential data. Sequential pattern structures are given by a subsumption operation between set of sequences, based on subsequence matching. To avoid a huge nu...

We introduce simple object calculi that support method override and object subsumption. We give an untyped calculus, typing rules, and equational rules. We illustrate the expressiveness of our calculi and the pitfalls that we avoid.

the article presents explanation and analysis of plotinus’ abstraction theology. in this theology he tries to get negative knowledge of the god. the meaning of the negation is neither of pure negation or privation but it is based on abstraction which purifies and abstracts one concept from else to attain the exact and true meaning of it. accordingly, this method of theology is the same as the r...