A Multi-modal Logic for Disagreement and Exhaustiveness

• Autorzy: Düntsch I. , Konikowska B.
• Języki publikacji: EN

Abstrakty

EN

The paper explores two basic types of relations betwen objects of a Pawlak-style information system generated by the values of some attribute of those objects: disagreement (disjoint sets of values) and exhaustiveness (sets of values adding up to the whole universe of the attribute). Out of these two fundamental types of relations, most other types of relations on objects of an information system considered in the literature can be derived - as, for example, indiscernibility, similarity and complementarity. The algebraic properties of disagreement and indiscernibility relations are explored, and a representation theorem for each of these two types of relations is proved. The notions of disagreement and exhaustiveness relations for a single attribute are extended to relations generated by arbitrary sets of attributes, yielding two families of relations parametrized by sets of attributes. They are used as accessibility relations to define a multi-modal logic with modalities corresponding to the lower and upper approximation of a set in Pawlak's rough set theory. Finally, a complete Rasiowa-Sikorski deduction system for that logic is developed.

Słowa kluczowe

EN

multi-modal logical

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2007
• Tom: Vol. 75, nr 1-4
• Strony: 215--238
• Opis fizyczny: bibliogr. 13 poz.

Twórcy

autor

Düntsch I.

autor

Konikowska B.

• Institute of Computer Science, Polish Academy of Science, Ordona 21, 01-237 Warsaw, Poland,

Bibliografia

• [1] Andréka, H., Németi, I.: 2001, Personal communication.
• [2] Beth, E.: The Foundations of Mathematics, North-Holland, Amsterdam, 1959.
• [3] Demri, S., Orłowska, E.: Complementarity relations: reduction of decision rules and informational representability, in: Rough sets in knowledge discovery, Vol. 1 (L. Polkowski, A. Skowron, Eds.), Physica-Verlag, Heidelberg, 1998, 99-106.
• [4] Demri, S., Orłowska, E.: Informational representability of models for information logics, in: Logic at Work (E. Orłowska, Ed.), Physica - Verlag, Heidelberg, 1998, 383-409.
• [5] Düntsch, I., Konikowska, B.: A multimodal logic for reasoning about complementarity, J. Appl. Non-Classical Logics, 10(3), 2000, 273-301.
• [6] Düntsch, I., Orłowska, E.: Logics of complementarity in information systems, Mathematical Logic Quarterly, 46, 2000, 267-288.
• [7] Konikowska, B.: A logic for reasoning about similarity, Studia Logica, 58, 1997, 185-226.
• [8] Konikowska, B.: A Logic for Reasoning about Similarity, in: Incomplete Information - Rough Set Analysis (E. Orłowska, Ed.), Physica - Verlag, Heidelberg, 1998, ISBN 3-7908-1049-5, 462-491.
• [9] Konikowska, B.: Rasiowa-Sikorski Deduction Systems in Computer Science Applications, Theoretical Computer Science, 286, 2002, 323-366.
• [10] Orłowska, E.: Information algebras, Algebraic Methodology and Software Technology, 4th International Conference, AMAST '95, Montreal, Canada, Proceedings (V. S. Alagar, M. Nivat, Eds.), 639, Springer-Verlag, 1995.
• [11] Pawlak, Z.: Information systems, theoretical foundations, Information Systems, 6, 1981, 205-218.
• [12] Pawlak, Z.: Rough Sets, Internat. J. Comput. Inform. Sci., 11, 1982, 341-356.
• [13] Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics, vol. 41 of Polska Akademia Nauk. Monografiematematyczne, PWN, Warsaw, 1963.