<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>From Free Will Debate to Embodiment of Fuzzy Logic into Washing Machines: On Fuzzy and Rough Sets ⋆ Approaches to Vagueness Modeling</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Extended Abstract</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Mathematics, Informatics and Mechanics University of Warsaw Banacha 2</institution>
          ,
          <addr-line>02-097 Warsaw</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <fpage>234</fpage>
      <lpage>236</lpage>
      <abstract>
        <p>Deep scientific ideas have at least one distinctive property: they can be applied both by philosophers in abstract fundamental debates and by engineers in concrete practical applications. Mathematical approaches to modeling of vagueness also possess this property. Problems connected with vagueness have been discussed at the beginning of XXth century by philosophers, logicians and mathematicians in developing foundations of mathematics leading to clarification of logical semantics and establishing of mathematical logic and set theory. Those investigations led also to big step in the history of logic: introduction of three-valued logic. In the second half of XXth century some mathematical theories based on vagueness idea and suitable for modeling vague concepts were introduced, including fuzzy set theory proposed by Lotfi Zadeh in 1965 [16] and rough set theory proposed by Zdziss¸aw Pawlak in 1982 [4] having many practical applications in various areas from engineering and computer science such as control theory, data mining, machine learning, knowledge discovery, artificial intelligence. Concepts in classical philosophy and in mathematics are not vague. Classical theory of concepts requires that definition of concept C hast to provide exact rules of the following form: if object x belongs to concept C, then x possess properties P1, P2, . . . , Pn; if object x possess properties P1, P2, . . . , Pn, then x belongs to concept C.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>a belongs to fuzzy set X what corresponds to vagueness of concepts. In particular if
μX (a) = 0, then object a does not belong to fuzzy set X and if μX (a) = 1, then
object a belongs to fuzzy set X in full degree what corresponds to classical notion of
belonging to a set.</p>
      <p>In rough set theory concepts are represented by subsets of a given space U and
objects are represented by granules, some collections of objects, in classical rough set
theory these granules are equivalence classes of some equivalence relation R on U . In
rough set theory sets are represented and analyzed by two operators: lower and upper
approximations, denoted respectively by R∗, R∗ and defined for set X ⊆ U as follows:
R∗(X) = [{Y ∈ U/R : Y ⊆ X}</p>
      <p>R∗(X) = [{Y ∈ U/R : Y ∩ X 6= ∅}.</p>
      <p>Set X ⊆ U is rough iff R∗(X) 6= R∗(X). With every set X ⊆ U there are
associated three sets called regions:
positive region</p>
      <p>P OS(X) := R∗(X),
negative region</p>
      <p>N EG(X) := U \ R∗(X) = R∗(X ) = [{E ∈ U/R : E ∩ X = ∅}
′
where X′ = U \ X and boundary region</p>
      <p>BN D(X) := R∗(X) \ R∗(X) = U \ (P OS(X) ∪ N EG(X)).</p>
      <p>Set X ⊆ U is rough iff BN D(X) 6= ∅. In the case of any set X ⊆ U positive region
of X can be interpreted as a set of objects from U which surely belongs to X, negative
region can be interpreted as a set of objects from U which surely do not belong to X,
whereas boundary region can be interpreted as a set of objects from U which possibly
belong to X.</p>
      <p>One can note that both approaches to modelling vagueness are some generalizations
in which crisp sets are particular cases: in fuzzy set theory fuzzy set Xof objects from
U is crisp iff for all a ∈ U either μX (a) = 1 or μX (a) = 0; in rough set theory set
X ⊆ U is crisp iff BN D(X) = ∅. Both theories are also essentially connected with
Łukasiewicz’s ideas.</p>
      <p>
        The main object of the paper is to present and compare fuzzy sets and rough
sets approaches to vagueness and uncertainty modelling and analysis, in particular we
will discuss representation of vague concepts in both theories. We will also present
Łukasiewicz’s arithmetization of propositional calculus semantics and Łukasiewicz’s
involvement in discussion on meaning and logical values of propositions about future
which led to introduction of the third logical value and to proposing three-valued logic.
Our comparison of fuzzy set theory and rough set theory approaches to vagueness
modelling will be made with respect to a characterization of vagueness proposed in
contemporary philosophy. This characterization includes a second order vagueness condition
which, roughly speaking, requires that a boundary of a concept cannot be a crisp set.
We will conclude the paper with presenting and discussion solutions to that problem
in the rough set approach to vagueness modelling including that proposed by Andrzej
Skowron in [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Keefe</surname>
          </string-name>
          , R.:
          <source>Theories of Vagueness</source>
          . Cambridge Studies in Philosophy, Cambridge University Press (
          <year>2000</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Keefe</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            <given-names>P.</given-names>
          </string-name>
          : (Eds.) Vagueness: A Reader. MIT Press, Massachusetts, MA.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Pawlak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Rough sets</article-title>
          .
          <source>International Journal of Computing and Information Sciences</source>
          .
          <volume>18</volume>
          (
          <year>1982</year>
          )
          <fpage>341</fpage>
          -
          <lpage>356</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Pawlak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Rough sets and fuzzy sets</article-title>
          .
          <source>Polish Academy of Sciences, Institute of Computer Sciences Reports</source>
          <volume>540</volume>
          (
          <year>1984</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Pawlak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Rough sets</article-title>
          .
          <source>Theoretical Aspects of Reasoning About Data</source>
          . Kluwer Academic Publishers (
          <year>1991</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Pawlak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>An Inquiry into Vagueness and Uncertainty</article-title>
          . Warsaw University of Technology,
          <source>Institute of Computer Science Reports</source>
          <volume>29</volume>
          (
          <year>1994</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Pawlak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <source>Some Issues on Rough Sets. Transactions on Rough Sets</source>
          ,
          <string-name>
            <given-names>I</given-names>
            ,
            <surname>Journal</surname>
          </string-name>
          <string-name>
            <surname>Subline</surname>
          </string-name>
          , Lectures Notes in Computer Science.
          <volume>3100</volume>
          (
          <year>2004</year>
          )
          <fpage>1</fpage>
          -
          <lpage>58</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Pawlak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skowron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Rough Membership Functions</article-title>
          . In R. R. Yager,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fedrizzi</surname>
          </string-name>
          , J. Kacprzyk (Eds.),
          <source>Advances in the Dempster-Schafer Theory of Evidence</source>
          , John Wiley and Sons (
          <year>1994</year>
          ), New York, 251U˝ -
          <fpage>271</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Pawlak</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skowron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Rudiments of rough sets</article-title>
          .
          <source>Information Science</source>
          .
          <volume>177</volume>
          (
          <year>2007</year>
          )
          <fpage>3</fpage>
          -
          <lpage>27</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Read</surname>
          </string-name>
          , R.:
          <article-title>Thinking about Logic: An Introduction to the Philosophy of Logic</article-title>
          . Oxford University Press, Oxford, New York (
          <year>1995</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Skowron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Rough sets and vague concepts</article-title>
          .
          <source>Fundamenta Informaticae</source>
          <volume>64</volume>
          (
          <issue>1-4</issue>
          ) (
          <year>2005</year>
          )
          <fpage>417</fpage>
          -
          <lpage>431</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Skowron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stepaniuk</surname>
          </string-name>
          , J.:
          <article-title>Hierarchical modelling in searching for complex patterns: constrained sums of information systems</article-title>
          .
          <source>Journal of Experimentaland Theoretical Artificial Intelligence</source>
          <volume>17</volume>
          (
          <issue>1-2</issue>
          ) (
          <year>2005</year>
          )
          <fpage>83</fpage>
          -
          <lpage>102</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Skowron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stepaniuk</surname>
          </string-name>
          , J.: Approximation Spaces in RoughU˝ Granular Computing.
          <source>Fundamenta Informaticae</source>
          <volume>100</volume>
          (
          <year>2010</year>
          )
          <fpage>141</fpage>
          -U˝
          <fpage>157</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Skowron</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wasilewski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Interactive information systems: Toward perception based computing</article-title>
          ,
          <source>Theoretical Computer Science</source>
          <volume>454</volume>
          ,
          <fpage>240</fpage>
          -
          <lpage>260</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Wasilewski</surname>
          </string-name>
          , P., S´ le¸zak, D.:
          <article-title>Foundations of Rough Sets from Vagueness Perspective</article-title>
          . In: A.E.
          <string-name>
            <surname>Hassanien</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <string-name>
            <surname>Suraj</surname>
            , D. S´ le¸zak, D.,
            <given-names>P.</given-names>
          </string-name>
          Lingras (Eds.) Rough Computing. Theories, Technologies and Applications. Information Science Refer. (
          <year>2008</year>
          ) 1-U˝
          <fpage>37</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          :
          <source>Fuzzy Sets. Information and Control</source>
          <volume>8</volume>
          (
          <issue>3</issue>
          ),
          <fpage>338</fpage>
          -
          <lpage>353</lpage>
          (
          <year>1965</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          :
          <article-title>The concept of a linguistic variable and¯ its application to approximate reasoning -</article-title>
          <source>Part I. Information Sciences</source>
          <volume>8</volume>
          (
          <issue>3</issue>
          ),
          <fpage>199</fpage>
          -
          <lpage>249</lpage>
          ;
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          .
          <source>Information Sciences</source>
          <volume>8</volume>
          (
          <issue>4</issue>
          ),
          <fpage>301</fpage>
          -
          <lpage>357</lpage>
          ; Part III.
          <source>Information Sciences</source>
          <volume>9</volume>
          (
          <issue>1</issue>
          ),
          <fpage>43</fpage>
          -
          <lpage>80</lpage>
          (
          <year>1975</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          :
          <article-title>Fuzzy sets as a basis for theory of possibility</article-title>
          ,
          <source>Fuzzy Sets and Systems</source>
          <volume>1</volume>
          ,
          <fpage>3</fpage>
          -
          <lpage>28</lpage>
          (
          <year>1978</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          :
          <article-title>Computing with Words: Principal Concepts</article-title>
          and
          <source>Ideas</source>
          . Springer Verlag, Berlin, Heidelberg (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>