We present a new axiomatization of logic for dependencies in data with grades, including ordinal data and data in an extension of Codd's model that takes into account similarity relations on domains. The axiomatization makes possible an efficient method for automated reasoning for such dependencies that is presented in the paper. The presented method of automatic reasoning is based on a new simplification equivalence which allows to simplify sets of dependencies while retaining their semantic closures. We include two algorithms for computing closures and checking semantic entailment from sets of dependencies and present experimental comparison showing that the algorithms based on the new axiomatization outperform the algorithms proposed in the past. © 2012 Springer-Verlag.
CITATION STYLE
Belohlavek, R., Cordero, P., Enciso, M., Mora, A., & Vychodil, V. (2012). An efficient reasoning method for dependencies over similarity and ordinal data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7647 LNAI, pp. 408–419). https://doi.org/10.1007/978-3-642-34620-0_36
Mendeley helps you to discover research relevant for your work.