Skip to main content
SpringerLink
Log in

First Order Rough Logic-Revisited

  • Conference paper
New Directions in Rough Sets, Data Mining, and Granular-Soft Computing (RSFDGrC 1999)

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

Abstract

Based on axiomatic rough set theory, first order rough logic was developed earlier. In this paper, a new model theory for that logic is introduced. With this new semantic, first order rough logic is shown to be equivalent to first order S5, and hence consistent and complete.

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 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. Lin, T.Y., Liu, Q.: Rough Approximate Operators-Axiomatic Rough Set Theory. In: Ziarko, W. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, pp. 256–260. Springer, Heidelberg (1994)

    Google Scholar 

  2. Lin, T.Y., Liu, Q.: First Order Rough Logic I: Approximate Reasoning via Rough Sets. Fundamenta Informaticae 27(2,3), 137–153 (1996)

    MATH  MathSciNet  Google Scholar 

  3. Lukaszewicz, W.: Non-Monotonic Reasoning-Formalization of Commonsense Reasoning. Institute of Information, Ellis Horwood limited (1990)

    Google Scholar 

  4. Pawlak, Z.: Rough Sets (Theoretical Aspects of Reasoning about Data). Kluwer Academic, Dordrecht (1991)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, San Jose State University, San Jose, California, 95192

    T. Y. Lin

  2. Department of Electrical Engineering and Computer Science, University of California, Berkeley, California, 94720

    T. Y. Lin

  3. Department of Computer Science, NanChang University, NanChang, Jiangxi, P.R.China

    Qing Liu

Authors
  1. T. Y. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qing Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The International WIC Institute, Beijing University of Technology, China

    Ning Zhong

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

  3. Professor Emeritus, University of Tokyo,  

    Setsuo Ohsuga

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, T.Y., Liu, Q. (1999). First Order Rough Logic-Revisited. In: Zhong, N., Skowron, A., Ohsuga, S. (eds) New Directions in Rough Sets, Data Mining, and Granular-Soft Computing. RSFDGrC 1999. Lecture Notes in Computer Science(), vol 1711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48061-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48061-7_34

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation