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...

Articulating a clear and concise research question is fundamental to conducting a robust and useful research study. Although “getting stuck into” the data collection is the exciting part of research, this preparation stage is crucial. Clear and concise research questions are needed for a number of reasons. Initially, they are needed to enable you to search the literature effectively. They will ...

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...

A dynamic programming problem that each state at some stage is chosen from a set decided by the state and action at the last stage, in other words, translate maps are set-valued maps, is considered and investigated. To solve the problem, two roles of choice of next stage are introduced; one is to the player’s advantage, and the other is disadvangate. Also, two duality formulations based on Fenc...

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...

Résumé. Un graphe étant un ensemble d’objets liés par une certaine relation typée, le problème de "modularisation" des grands graphes (qui revient à leur partitionnement en classes) peut, alors, être modélisé mathématiquement via l’Analyse Relationnelle. Cette modélisation permet de comparer sur les mêmes bases un certain nombre de critères de découpage de graphe c’est-à-dire de modularisation....

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...

The set of integer solutions (x 1 , x 2 , x 3) to the equation (1.1) x 2 1 + x 2 2 + x 2 3 = n has been much studied. However it appears that the spatial distribution of these solutions at small and critical scales as n → ∞ have not been addressed. The main results announced below give strong evidence to the thesis that the solutions behave randomly. This is in sharp contrast to what happens wi...

We give several characterizations of discrete Sugeno integrals over bounded distributive lattices, as particular cases of lattice polynomial functions, that is functions which can be represented in the language of bounded lattices using variables and constants. We also consider the subclass of term functions as well as the classes of symmetric polynomial functions and weighted minimum and maxim...