The Experts below are selected from a list of 174 Experts worldwide ranked by ideXlab platform
M. A. Vila - One of the best experts on this subject based on the ideXlab platform.
-
Part II: Transitive Fuzzy Dependencies
2007Co-Authors: Cubero Medina, J. C. Cubero, J. M. Medina, O. Pons, M. A. VilaAbstract:In the previous work we accomplished the problem of defining fuzzy dependency as well as projection and join operators which allow us to decompose a database in such a way that this process is fuzzy loss less. The definition of rules-based fuzzy dependency did not satisfy the Transitivity Axiom, which is crucial to obtaining the completeness of the counterpart of Armstrong Axioms for fuzzy dependencies. In this paper we introduce an alternative definition of dependency called restricted dependency, satisfying the Transitivity property of inference. All the results obtained with the first definition of dependency are also extended to this case. The price to pay for Transitivity is a more restricted definition of fuzzy dependency. Keywords: Fuzzy Functional Dependencies, Fuzzy Projection, Fuzzy Join, Fuzzy Loss Less Decompositions, Transitivity Axiom. 1 Definition of Transitive Rules Based Fuzzy Functional Dependencies We assume the same notation and preliminaries introduced in Sectio..
-
Transitive fuzzy dependencies (II)
Fuzzy Sets and Systems, 1999Co-Authors: J. C. Cubero, J. M. Medina, O. Pons, M. A. VilaAbstract:In the previous work we accomplished the problem of defining fuzzy dependency as well as projection and join operators which allow us to decompose a database in such a way that this process is fuzzy loss less. The definition of rules-based fuzzy dependency did not satisfy the Transitivity Axiom, which is crucial to obtaining the completeness of the counterpart of Armstrong Axioms for fuzzy dependencies. In this paper we introduce an alternative definition of dependency called restricted dependency, satisfying the Transitivity property of inference. All the results obtained with the first definition of dependency are also extended to this case. The price to pay for Transitivity is a more restricted definition of fuzzy dependency.
Pavel Naumov - One of the best experts on this subject based on the ideXlab platform.
-
AAAI - Armstrong's Axioms and Navigation Strategies
2018Co-Authors: Kaya Deuser, Pavel NaumovAbstract:The paper investigates navigability with imperfect information. It shows that the properties of navigability with perfect recall are exactly those captured by Armstrong's Axioms from the database theory. If the assumption of perfect recall is omitted, then Armstrong's Transitivity Axiom is not valid, but it can be replaced by two new weaker principles. The main technical results are soundness and completeness theorems for the logical systems describing properties of navigability with and without perfect recall.
-
Armstrong's Axioms and Navigation Strategies
arXiv: Artificial Intelligence, 2017Co-Authors: Kaya Deuser, Pavel NaumovAbstract:The paper investigates navigability with imperfect information. It shows that the properties of navigability with perfect recall are exactly those captured by Armstrong's Axioms from the database theory. If the assumption of perfect recall is omitted, then Armstrong's Transitivity Axiom is not valid, but it can be replaced by two new weaker principles. The main technical results are soundness and completeness theorems for the logical systems describing properties of navigability with and without perfect recall.
-
IJCAI - Budget-Constrained Dynamics in Multiagent Systems
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017Co-Authors: Rui Cao, Pavel NaumovAbstract:The paper introduces a notion of a budget-constrained multiagent transition system that associates two financial parameters with each transition: a pre-transition minimal budget requirement and a post-transition profit. The paper also proposes a new modal language for reasoning about such a system. The language uses a modality labeled by agent as well as by budget and profit constraints. The main technical result is a sound and complete logical system that describes all universal properties of this modality. Among these properties is a form of Transitivity Axiom that captures the interplay between the budget and profit constraints.
J. C. Cubero - One of the best experts on this subject based on the ideXlab platform.
-
Part II: Transitive Fuzzy Dependencies
2007Co-Authors: Cubero Medina, J. C. Cubero, J. M. Medina, O. Pons, M. A. VilaAbstract:In the previous work we accomplished the problem of defining fuzzy dependency as well as projection and join operators which allow us to decompose a database in such a way that this process is fuzzy loss less. The definition of rules-based fuzzy dependency did not satisfy the Transitivity Axiom, which is crucial to obtaining the completeness of the counterpart of Armstrong Axioms for fuzzy dependencies. In this paper we introduce an alternative definition of dependency called restricted dependency, satisfying the Transitivity property of inference. All the results obtained with the first definition of dependency are also extended to this case. The price to pay for Transitivity is a more restricted definition of fuzzy dependency. Keywords: Fuzzy Functional Dependencies, Fuzzy Projection, Fuzzy Join, Fuzzy Loss Less Decompositions, Transitivity Axiom. 1 Definition of Transitive Rules Based Fuzzy Functional Dependencies We assume the same notation and preliminaries introduced in Sectio..
-
Transitive fuzzy dependencies (II)
Fuzzy Sets and Systems, 1999Co-Authors: J. C. Cubero, J. M. Medina, O. Pons, M. A. VilaAbstract:In the previous work we accomplished the problem of defining fuzzy dependency as well as projection and join operators which allow us to decompose a database in such a way that this process is fuzzy loss less. The definition of rules-based fuzzy dependency did not satisfy the Transitivity Axiom, which is crucial to obtaining the completeness of the counterpart of Armstrong Axioms for fuzzy dependencies. In this paper we introduce an alternative definition of dependency called restricted dependency, satisfying the Transitivity property of inference. All the results obtained with the first definition of dependency are also extended to this case. The price to pay for Transitivity is a more restricted definition of fuzzy dependency.
Emanuel Kolb - One of the best experts on this subject based on the ideXlab platform.
-
the schwan artin coordinatization for nearfield planes
Geometriae Dedicata, 1994Co-Authors: Emanuel KolbAbstract:Given any translation planeU, one can define the nucleusN as the subset of trace-preserving mappings of the point set satisfying a special linearity condition.N is always a nearfield isomorphic to the right-nucleus of a coordinatizing (left-)quasifield. If the Transitivity Axiom (NT) is valid,N is planar and the plane is isomorphic to the nearfield plane overN. Finally it is shown that (NT) is equivalent to the usual (P, OQ)-Transitivity condition for nearfield planes.
-
The Schwan/Artin coordinatization for nearfield planes
Geometriae Dedicata, 1994Co-Authors: Emanuel KolbAbstract:Given any translation plane U , one can define the nucleus N as the subset of trace-preserving mappings of the point set satisfying a special linearity condition. N is always a nearfield isomorphic to the right-nucleus of a coordinatizing (left-)quasifield. If the Transitivity Axiom (NT) is valid, N is planar and the plane is isomorphic to the nearfield plane over N . Finally it is shown that (NT) is equivalent to the usual ( P, OQ )-Transitivity condition for nearfield planes.
O. Pons - One of the best experts on this subject based on the ideXlab platform.
-
Part II: Transitive Fuzzy Dependencies
2007Co-Authors: Cubero Medina, J. C. Cubero, J. M. Medina, O. Pons, M. A. VilaAbstract:In the previous work we accomplished the problem of defining fuzzy dependency as well as projection and join operators which allow us to decompose a database in such a way that this process is fuzzy loss less. The definition of rules-based fuzzy dependency did not satisfy the Transitivity Axiom, which is crucial to obtaining the completeness of the counterpart of Armstrong Axioms for fuzzy dependencies. In this paper we introduce an alternative definition of dependency called restricted dependency, satisfying the Transitivity property of inference. All the results obtained with the first definition of dependency are also extended to this case. The price to pay for Transitivity is a more restricted definition of fuzzy dependency. Keywords: Fuzzy Functional Dependencies, Fuzzy Projection, Fuzzy Join, Fuzzy Loss Less Decompositions, Transitivity Axiom. 1 Definition of Transitive Rules Based Fuzzy Functional Dependencies We assume the same notation and preliminaries introduced in Sectio..
-
Transitive fuzzy dependencies (II)
Fuzzy Sets and Systems, 1999Co-Authors: J. C. Cubero, J. M. Medina, O. Pons, M. A. VilaAbstract:In the previous work we accomplished the problem of defining fuzzy dependency as well as projection and join operators which allow us to decompose a database in such a way that this process is fuzzy loss less. The definition of rules-based fuzzy dependency did not satisfy the Transitivity Axiom, which is crucial to obtaining the completeness of the counterpart of Armstrong Axioms for fuzzy dependencies. In this paper we introduce an alternative definition of dependency called restricted dependency, satisfying the Transitivity property of inference. All the results obtained with the first definition of dependency are also extended to this case. The price to pay for Transitivity is a more restricted definition of fuzzy dependency.
