An efficient reasoning method for dependencies over similarity and ordinal data

  • Authors:

  • Radim Belohlavek;Pablo Cordero;Manuel Enciso;Angel Mora;Vilem Vychodil

  • Affiliations:

  • Data Analysis and Modeling Laboratory (DAMOL), Dept. Computer Science, Palacky University, Olomouc, Czech Republic;Dept. Applied Mathematics, University of Málaga, Spain;Dept. Languages and Computer Sciences, University of Málaga, Spain;Dept. Applied Mathematics, University of Málaga, Spain;Data Analysis and Modeling Laboratory (DAMOL), Dept. Computer Science, Palacky University, Olomouc, Czech Republic

  • Venue:
  • MDAI'12 Proceedings of the 9th international conference on Modeling Decisions for Artificial Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.