We describe several developments of a technique, due to Hartmanis, that uses Kolmogorov complexity to prove the existence of relativizations separating complexity classes. The main advantage of these proofs is that they ...

We propose a notion of deterministic association rules for ordered data. We prove that our proposed rules can be formally justified by a purely logical characterization, namely, a natural notion of empirical Horn approximation ...

We describe the internal algorithmics of our recent implementation of a closure-based self-tuning associator: yacaree. This system is designed so as not to request the user to specify any threshold. In order to avoid the ...

A definite Horn theory is a set of n-dimensional Boolean vectors whose characteristic function is expressible as a definite Horn formula, that is, as conjunction of definite Horn clauses. The class of definite Horn theories ...

A definition of self-reducibility is proposed to deal with logarithmic space complexity classes. A general property derived from the definition is used to prove known results comparing uniform and nonuniform complexity ...

Association rules constitute a well-known and widely employed data mining technique. We study their applicability in Educational Data Mining. We develop a case study of datasets from that eld: logs of an e-learning ...

In Database Theory, Multivalued Dependencies are the main tool to define the Fourth Normal Form and, as such, their inference problem has been deeply studied; two related notions appearing in that study are a syntactical ...

On sait bien que la confiance des régles d’association n’est pas vraiment satisfaisant comme mésure d’interêt. Nous proposons, au lieu de la substituer par des autres mésures (soit, en l’employant de façon conjointe a des ...

Non-uniform complexity measures origined in Automata and Formal Languages Theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several ...

We introduce and study a family of interconnection schemes, the Midimew networks, based on circulant graphs of degree 4. A family of such circulants is determined and shown to be optimal with respect to two distance ...