Herein, relations are generalised to variable length tuple relations (variabe relations) wherein tuples are allowed to be of variable length. We define the concept of a functional dependency (FD) holding in variable relations and present a sound and complete axiom system for them. Our main result shows an equivalence between FDs holding in variable relations and propositional implications holding in (a subset of) a three-valued propositional logic. We extend this result to object relations, which are a subclass of variable relations enabling us to view tuples as objects
In this paper, first, we determine the number of sublogics of variable inclusion of an arbitrary fin...
In this paper we first introduce a new definition for the conformance of tuples existing in a fuzzy ...
Functional dependencies, a notion originated in Relational Database Theory, are known to admit inter...
Abstract: An equivalence is shown between functional dependency statements of a relational database,...
International audienceThree-valued logics arise in several fields of computer science, both inspired...
AbstractWe extend the result on the equivalence between functional and multivalued dependencies in r...
In Database Theory, Multivalued Dependencies are the main tool to define the Fourth Normal Form and,...
The calculus of functional dependencies has proven very efficient in designing databases. This work ...
We study inference systems of weak functional dependencies in relational and complex-value databases...
Incomplete relations are relations which contain null values, whose meaning is “value is at present ...
International audienceIn the literature, several 3-valued logics can be found. They differ from a sy...
AbstractThe functional dependency (FD) structures, known mainly from database relationships theory, ...
We present a lattice-base formalism to relate, in a novel way, different representation methods for ...
In formal logic, both semantic entailment and the conditional connective are used to formalize the i...
A formal system for reasoning about functional dependencies (FDs) and subset dependencies (SDS) defi...
In this paper, first, we determine the number of sublogics of variable inclusion of an arbitrary fin...
In this paper we first introduce a new definition for the conformance of tuples existing in a fuzzy ...
Functional dependencies, a notion originated in Relational Database Theory, are known to admit inter...
Abstract: An equivalence is shown between functional dependency statements of a relational database,...
International audienceThree-valued logics arise in several fields of computer science, both inspired...
AbstractWe extend the result on the equivalence between functional and multivalued dependencies in r...
In Database Theory, Multivalued Dependencies are the main tool to define the Fourth Normal Form and,...
The calculus of functional dependencies has proven very efficient in designing databases. This work ...
We study inference systems of weak functional dependencies in relational and complex-value databases...
Incomplete relations are relations which contain null values, whose meaning is “value is at present ...
International audienceIn the literature, several 3-valued logics can be found. They differ from a sy...
AbstractThe functional dependency (FD) structures, known mainly from database relationships theory, ...
We present a lattice-base formalism to relate, in a novel way, different representation methods for ...
In formal logic, both semantic entailment and the conditional connective are used to formalize the i...
A formal system for reasoning about functional dependencies (FDs) and subset dependencies (SDS) defi...
In this paper, first, we determine the number of sublogics of variable inclusion of an arbitrary fin...
In this paper we first introduce a new definition for the conformance of tuples existing in a fuzzy ...
Functional dependencies, a notion originated in Relational Database Theory, are known to admit inter...