Skip to main content

Toward Rough Datalog: Embedding Rough Sets in Prolog

  • Chapter

Part of the book series: Cognitive Technologies ((COGTECH))

Summary

This chapter extends the principles of logic programming forrough relations.The work is based on the formalism ofrough sets[9,16,17], introduced for describing imprecise information. Its objective is to develop techniques that facilitate formal definition of imprecise concepts and reasoning about them.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. K.R. Apt, M. van Emden. Contributions to the theory of logic programming.Journal of the ACM29: 841–862, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  2. M. Banerjee, M.K. Chakraborty. Algebras from rough sets (this book).

    Google Scholar 

  3. P. Deransart, A. Ed-Bali, L. Cervoni.Prolog: The Standard Reference Manual. Springer, Berlin, 1996.

    Book  MATH  Google Scholar 

  4. I. Duentsch I. Rough sets algebras of relations. In E. Orlowska, editorIncomplete Information: Rough Set Analysis95–108, Physica, Heidelberg, 1998.

    Chapter  Google Scholar 

  5. M.C. Fitting. A Kripke/Kleene semantics for logic programs.Jornal of Logic Programming2: 295–312,1985.

    Article  MathSciNet  MATH  Google Scholar 

  6. T. Iwiftski. Algebraic approach to rough sets.Bulletin of the Polish Academy of Sciences. Mathematics35: 673–683, 1987.

    MathSciNet  Google Scholar 

  7. S.C Kleene.Introduction to Metamathematics. Van Nostrand, Princeton, NJ, 1950.

    Google Scholar 

  8. J. Komorowski, Z. Pawlak, L.Polkowski, A. Skowron. Rough sets: A tutorial. In S. K. Pal, A. Skowron, editorsRough Fuzzy Hybridization: A New Trend in Decision MakingSpringer, Singapore, 1999.

    Google Scholar 

  9. C. Liu, N. Zhong. Dealing with imperfect data by RS-ILP. In S. Hirano, M. Inuiguchi, S. Tsumoto, editorsProceedings of the International Workshop on Rough Set Theory and Granular Computing (RSTGC 2001)Vol. 5(1/2) of the Bulletin of International Rough Set Society2001.

    Google Scholar 

  10. J.W. Lloyd. Foundations of Logic Programming(2nd ed.) Springer, Berlin, 1987.

    Book  MATH  Google Scholar 

  11. G. Meuvis.Developing a Prolog System for Rough Set ReasoningMaster’s Thesis, Linköping University, 2001.

    Google Scholar 

  12. U. Nilsson, J. Maluszynski.Logic Programming and Prolog(2nd ed.) Wiley, New York, 1995. Available athttp://www.ida.liu.se/ulfni/lpp/copyright.html.

    Google Scholar 

  13. A. Obtulowicz. Rough sets and Heyting algebra valued sets.Bulletin of the Polish Academy of Sciences. Mathematics35(9/10): 667–671, 1987.

    MathSciNet  MATH  Google Scholar 

  14. P. Pagliani. Rough set theory and logic-algebraic structures. In E. Orlowska, editorIncomplete Information: Rough Set Analysis109–190, Physica, Heidelberg, 1998.

    Chapter  Google Scholar 

  15. Z. Pawlak. Rough sets.International Journal of Computer and Information Sciences11(5): 341–356, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  16. Z. Pawlak.Rough Sets: Theoretical Aspects of Reasoning about DataKluwer, Dordrecht, 1991.

    MATH  Google Scholar 

  17. A. Tarski.A lattice-theoretical theorem and its applications.Pacific Journal of Mathematics5: 285–309, 1955.

    Article  MathSciNet  MATH  Google Scholar 

  18. J.D. Ullman.Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville, MD, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Małuszyński, J., Vitória, A. (2004). Toward Rough Datalog: Embedding Rough Sets in Prolog. In: Pal, S.K., Polkowski, L., Skowron, A. (eds) Rough-Neural Computing. Cognitive Technologies. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18859-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18859-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62328-8

  • Online ISBN: 978-3-642-18859-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics