Skip to main content
SpringerLink
Log in

The Resolution for Rough Propositional Logic with Lower (L) and Upper (H) Approximate Operators

  • Conference paper
Book cover 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 First-Order Rough Logic Studied by Lin and Liu, this paper establishes rough propositional logical system with rough lower (L) and upper (H) approximate operators. It discusses the resolution principle in the system. The soundness of resolution deduction, soundness and completeness of the refutation are also studied in the paper.

The study is supported by national natural science fund and JiangXi Province natural science fund in China.

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.: First-Order Rough Logic I:Approximate Reasoning via Rough Sets. Fundamenta Infomaticae 27(2,3), 137–154 (1996)

    MATH  MathSciNet  Google Scholar 

  2. Lin, T.Y., Liu, Q.: First-Order Rough Logic Revised. Manuscript 5 (1999)

    Google Scholar 

  3. Farinas-del-Cerro, L.: Resolution Modal Logic. In: Proceedings of the Eighth International Coference on Atomata Deduction (1985)

    Google Scholar 

  4. Liu, Q.: The OI-Resolution of Operator Rough Logic. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 432–435. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Liu, Q.: Operator Rough Logic and Its Resolution Principles. Journal of Coputer (May 1998) (Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, NanChang University, NanChang, JiangXi, 330029, P.R.China

    Qing Liu

Authors
  1. 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

Liu, Q. (1999). The Resolution for Rough Propositional Logic with Lower (L) and Upper (H) Approximate Operators. 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_42

Download citation

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

  • 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