Skip to main content

Query Answering in Rough Knowledge Bases

  • Conference paper
  • First Online:
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2003)

Abstract

We propose a logic programming language which makes it possible to define and to reason about rough sets. In particular we show how to test for rough inclusion and rough equality. This extension to our previous work [7] is motivated by the need of these concepts in practical applications.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Apt and R. Bol. Logic programming and negation: A survey. In Journal of Logic Programming, volume 19/20, pages 9–72. Elsevier, May/July 1994.

    Google Scholar 

  2. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The KR system dlv: Progress report, comparisons and benchmarks. In A. G. Cohn, L. Schubert, and S. C. Shapiro, editors, KR’98: Principles of Knowledge Representation and Reasoning, pages 406–417, San Francisco, California, 1998. Morgan Kaufmann.

    Google Scholar 

  3. I. Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In M. Maher, editor, Proc. of the Joint International Conference and Symposium on Logic Programming, pages 289–303, Bonn, Germany, 1996. MIT Press.

    Google Scholar 

  4. Z. Pawlak. Rough sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, 1991.

    MATH  Google Scholar 

  5. D. Pearce. Answer sets and constructive logic, II: Extended logic programs and related non-monotonic formalisms. In L. Pereira and A. Nerode, editors, Logic Programming and Nonmonotonic Reasoning — proceedings of the second international workshop, pages 457–475. MIT Press, 1993.

    Google Scholar 

  6. C. Sakama and K. Inoue. Paraconsistent Stable Semantics for Extended Disjunctive Programs. Journal of Logic and Computation, 5(3):265–285, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Vitória and J. Małuszyński. A logic programming farmework for rough sets. In J. Alpigini, J. Peters, A. Skowron, and N. Zhong, editors, Proc. of the 3rd International Conference on Rough Sets and Current Trends in Computing, RSCTC’02, number 2475 in LNCS/LNAI, pages 205–212. Springer-Verlag, 2002.

    Chapter  Google Scholar 

  8. W. Ziarko and X. Fei. VPRSM approach to WEB searching. In J. Alpigini, J. Peters, A. Skowron, and N. Zhong, editors, Proc. of the 3rd International Conference on Rough Sets and Current Trends in Computing, RSCTC’02, number 2475 in LNCS/LNAI, pages 514–521. Springer-Verlag, 2002.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vitória, A., Damásio, C.V., Małuszyński, J. (2003). Query Answering in Rough Knowledge Bases. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2003. Lecture Notes in Computer Science(), vol 2639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39205-X_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-39205-X_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14040-5

  • Online ISBN: 978-3-540-39205-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics