Skip to main content
SpringerLink
Log in

Bipolar Queries with Dialogue: Rough Set Semantics

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11103))

Included in the following conference series:

Abstract

This paper proposes an interpretation of characterizing required condition and desired condition of an user, that is a bipolar query, from the perspective of rough set semantics with an additional feature of learning the user’s need through dialogue.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Instead of calling (\(U, IND_{B}\)) as approximation space one may call it indiscernibility space. But as the notions of approximation, like the lower and upper approximation operators, are defined based on \(IND_{B}\), we follow the prevalent practice of calling (\(U, IND_{B}\)) as approximation space, rather than calling (U, Low, Upp) as the approximation space generated from the indiscernibility space (\(U, IND_{B}\)).

  2. 2.

    In literature (see, e.g., [1, 13,14,15,16, 18, 22,23,24]) there are different variant definitions of rough sets; interrelations among these different definitions and operations parallel to set theoretic union, intersection and complementation are also studied by different researchers (see, e.g., [1,2,3, 7]). Unlike ordinary sets, the set of all rough sets over a universe U with respect to intersection, union and complementation does not form a Boolean algebra, and so intersection, union and complementation operations of rough sets are a bit different than the usual ones. In this paper, instead of going into the detail we refer the readers to the cited above literature.

References

  1. Banerjee, M., Chakraborty, M.K.: A category for rough sets. Found. Comput. Decis. Sci. 18(3–4), 167–180 (1993)

    MathSciNet  MATH  Google Scholar 

  2. Banerjee, M., Chakraborty, M.K.: Rough algebra. Bull. Polish Acad. Sc. (Math.) 41(4), 293–297 (1993)

    MathSciNet  MATH  Google Scholar 

  3. Bonikowski, Z.: A certain conception of the calculus of rough sets. Notre Dame J. Formal Logic 33, 412–421 (1992)

    Article  MathSciNet  Google Scholar 

  4. Casali, A., Godo, L., Sierra, C.: g-BDI: a graded intensional agent model for practical reasoning. In: Torra, V., Narukawa, Y., Inuiguchi, M. (eds.) MDAI 2009. LNCS (LNAI), vol. 5861, pp. 5–20. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04820-3_2

    Chapter  MATH  Google Scholar 

  5. Dubois, D., Prade, P.: An overview of the symmetric bipolar representation of positive and negative information in possibility theory. Fuzzy Sets Syst. 160(10), 1355–1366 (2009)

    Article  Google Scholar 

  6. Dutta, S., Wasilewski, P.: Dialogue in hierarchical learning of concepts using prototypes and counterexamples. Fundame. Informaticae 162, 1–20 (2018)

    Article  Google Scholar 

  7. Gehrke, M., Walker, E.: The structure of rough sets. Bull. Polish Acad. Sc. (Math.) 40, 235–245 (1992)

    MathSciNet  MATH  Google Scholar 

  8. Kacprzyk, J., Zadrożny, S.: Bipolar queries: some inspirations from intention and preference modeling. In: Trillas, E., Bonissone, P., Magdalena, L., Kacprzyk, J. (eds.) Combining Experimentation and Theory. Studies in Fuzziness and Soft Computing, vol. 271, pp. 191–208. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-24666-1_14

  9. Kacprzyk, J., Zadrożny, S.: Compound bipolar queries: a step towards an enhanced human consistency and human friendliness. In: Matwin, S., Mielniczuk, J. (eds.) Challenges in Computational Statistics and Data Mining. SCI, vol. 605, pp. 93–111. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-18781-5_6

    Chapter  Google Scholar 

  10. Kacprzyk, J., Zadrożny, S.: Compound bipolar queries: the case of data with a variable quality. In: 2017 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2017, Naples, Italy, 9–12 July 2017, pp. 1–6. IEEE (2017)

    Google Scholar 

  11. Khan, M.A., Banerjee, M.: A preference-based multiple-source rough set model. In: Szczuka, M.S., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS (LNAI), vol. 6086, pp. 247–256. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13529-3_27

    Chapter  Google Scholar 

  12. Lacroix, M., Lavency, P.: Preferences: putting more knowledge into queries. In: proceedings of the 13th International Conference on Very Large Databases, Brighton, UK, pp. 217–225 (1987)

    Google Scholar 

  13. Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough sets: a tutorial. In: Pal, S.K., Skowron, A. (eds.) Rough Fuzzy Hybridization: A New Trend in Decision Making, p. 398. Springer, Singapore (1999)

    Google Scholar 

  14. Pagliani, P., Chakraborty, M.: A Geometry of Approximation: Rough Set Theory: Logic, Algebra and Topology of Conceptual Patterns. Trends in Logic, vol. 27. Springer, Heidelberg (2008)

    Google Scholar 

  15. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)

    Article  Google Scholar 

  16. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, System Theory, Knowledge Engineering and Problem Solving, vol. 9. Kluwer Academic Publishers, Dordrecht (1991)

    Book  Google Scholar 

  17. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Inf. Sci. 177(1), 3–27 (2007)

    Article  MathSciNet  Google Scholar 

  18. Pawlak, Z., Skowron, A.: Rough sets: some extensions. Inf. Sci. 177(1), 28–40 (2007)

    Article  MathSciNet  Google Scholar 

  19. Rasiowa, H., Marek, W.: Mechanical proof systems for logic II, consensus programs and their processing. J. Intell. Inf. Syst. 2(2), 149–164 (1993)

    Article  Google Scholar 

  20. Rauszer, C.M.: Rough logic for multi-agent systems. In: Masuch, M., Pólos, L. (eds.) Logic at Work 1992. LNCS, vol. 808, pp. 161–181. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58095-6_12

    Chapter  Google Scholar 

  21. Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27(2–3), 245–253 (1996)

    MathSciNet  MATH  Google Scholar 

  22. Skowron, A., Jankowski, A., Swiniarski, R.W.: Foundations of rough sets. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 331–348. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-43505-2_21

    Chapter  Google Scholar 

  23. Nguyen, H.S., Skowron, A.: Rough sets: from rudiments to challenges. In: Skowron, A., Suraj, Z. (eds.) Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam. Intelligent Systems Reference Library, vol. 42, pp. 75–173. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-30344-9_3

  24. Yao, Y.: Two views of the theory of rough sets in finite universes. Int. J. Approx. Reasoning 15, 291–317 (1996)

    Article  MathSciNet  Google Scholar 

  25. Qian, Y., Jiye, L.J., Yao, Y.Y., Dang, C.: MGRS: a multi-granulation rough set. Inf. Sci. 180, 949–970 (2010)

    Article  MathSciNet  Google Scholar 

  26. Ziarko, W.: Variable precision rough set model. J. Comput. Syst. Sci. 46, 39–59 (1993)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vistula University, Stokłosy 3, 02-787, Warsaw, Poland

    Soma Dutta

  2. Department of Mathematics and Computer Science, University of Warmia and Mazury, Sloneczna str. 54, 10-710, Olsztyn, Poland

    Soma Dutta

  3. Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

  4. Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01-447, Warsaw, Poland

    Andrzej Skowron

Authors
  1. Soma Dutta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Skowron
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soma Dutta .

Editor information

Editors and Affiliations

  1. University of Warsaw, Warsaw, Poland

    Hung Son Nguyen

  2. Faculty of Information Technology, Vietnam National University, Hanoi, Vietnam

    Quang-Thuy Ha

  3. School of Information Science, Southwest Jiaotong University, Chengdu, China

    Tianrui Li

  4. Institute of Computer Science, University of Silesia, Sosnowiec, Poland

    Małgorzata Przybyła-Kasperek

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dutta, S., Skowron, A. (2018). Bipolar Queries with Dialogue: Rough Set Semantics. In: Nguyen, H., Ha, QT., Li, T., Przybyła-Kasperek, M. (eds) Rough Sets. IJCRS 2018. Lecture Notes in Computer Science(), vol 11103. Springer, Cham. https://doi.org/10.1007/978-3-319-99368-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99368-3_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99367-6

  • Online ISBN: 978-3-319-99368-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation