Skip to main content
Conference Proceedings

The resolution for rough propositional logic with lower (L) and upper (H) approximate operators

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1711 352-356
DOI: 10.1007/978-3-540-48061-7_42
6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Liu, Q. (1999). The resolution for rough propositional logic with lower (L) and upper (H) approximate operators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1711, pp. 352–356). Springer Verlag. https://doi.org/10.1007/978-3-540-48061-7_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free