Arrow Logic with Arbitrary Intersections: Applications to Pawlak's Information Systems

Authors:
Philippe Balbiani;Dimiter Vakarelov
Affiliations:
Université Paul Sabatier, Institut de recherche en informatique de Toulouse, 31062 Toulouse Cedex 9, France. E-mail: balbiani@irit.fr;Sofia University Faculty of Mathematics and Computer Science blvd James Bouchier 5, 1126 Sofia, Bulgaria. E-mail: dvak@fmi.univ-sofia.bg
Venue:
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Year:
2007

Citing 8
Cited 0

Many-dimensional arrow structures: arrow logics II

Arrow logic and multi-modal logic
A class of decidable information logics

MFCS '96 Selected papers from the 21st symposium on Mathematical foundations of computer science
The nondeterministic information logic NIL is PSPACE-complete

Fundamenta Informaticae
Modal logic

Modal logic
Incomplete Information: Rough Set Analysis

Incomplete Information: Rough Set Analysis
Incomplete Information: Structure, Inference, Complexity

Incomplete Information: Structure, Inference, Complexity
A Modal Theory of Arrows. Arrow Logics I

JELIA '92 Proceedings of the European Workshop on Logics in AI
Iteration-free PDL with Intersection: a Complete Axiomatization

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We dedicate this paper to the memory of Zdislaw Pawlak, the founder of rough sets methodology in computer science. A great deal of our scientific work was motivated and influenced by Pawlak's ideas.