A formal approach to Perception Calculus of Zadeh by means of rough mereological logic

Rough set theory is a paradigm for approximate reasoning based on the assumption that concepts are divided into exact and non–exact (called also rough) ones by means of a topological structure induced by a representation of knowledge as a classification. A classification in its most simple form is an equivalence relation on a universe of objects; the classification induces a partition topology and concepts (meant as subsets of the universe) that are clopen are exact whereas other concepts are rough. In consequence, rough sets are represented as pairs of exact sets of the form (interior, closure). Investigations into deeper structures resulting from that assumption have led to an idea of rough mereology. On this ground also possibility for intensional many–valued logics has been recognized that have been called rough mereological logics. In this contribution, we present a development of rough mereological logics and we propose an application for these logics as a framework within which Calculus of Perceptions outlined by Zadeh may be given a formal rendering as a tool for semantic interpretation of vague statements.

[1]  Dimiter Vakarelov,et al.  Information Systems, Similarity Relations and Modal Logics , 1998 .

[2]  Ewa Orlowska,et al.  Modal Logics in the Theory of Information Systems , 1984, Math. Log. Q..

[3]  Lech Polkowski,et al.  A Note on 3-valued Rough Logic Accepting Decision Rules , 2004, Fundam. Informaticae.

[4]  Lech Polkowski,et al.  Formal granular calculi based on rough inclusions , 2005, 2005 IEEE International Conference on Granular Computing.

[5]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[6]  Andrzej Skowron,et al.  Rough mereology: A new paradigm for approximate reasoning , 1996, Int. J. Approx. Reason..

[7]  P. Pagliani Rough Set Theory and Logic-Algebraic Structures , 1998 .

[8]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[9]  Andrzej Skowron,et al.  Approximation logic , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

[10]  Ewa Orlowska,et al.  Representation of Nondeterministic Information , 1984, Theor. Comput. Sci..

[11]  Helena Rasiowa,et al.  Rough concepts logic , 1984, Symposium on Computation Theory.

[12]  Ewa Orlowska Logic For Reasoning About Knowledge , 1989, Math. Log. Q..

[13]  S. Poirier Foundations of Mathematics , 2007 .