Indiscernibility-Based Formalization of Dependencies in Information Systems
Wojciech Buszkowski, Ewa S. Orłowska · Studies in fuzziness and soft computing · 1998
Various classes of data constraints in information systems are modelled by means of indiscernibility relations induced by sets of attributes. A relational logic is presented that enables us to express these constraints. A proof system for the logic is given and its completeness is proved with respect to a class of algebras of relations generated by indiscernibility relations. Some other classes of models for the logic are defined that correspond to typical kinds of constraints in information systems. Decidability of the validity problem with respect to these classes of models is discussed and some classes of formulas with the decidable validity problem are given. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.