Paper Info
Title
Heyting-Brouwer Rough Set Logic.
Abstract
A rough set logic based on Heyting-Brouwer algebras HBRSL is proposed as a basis for reasoning about rough information. It is an extension of Duntsch's logic with intuitionistic implication, and is seen as a variant of Heyting-Brouwer logic. A Kripke semantics and natural deduction for the logic are presented and the completeness theorem is proved.
Year
DOI
Venue
2013
10.1007/978-3-319-02821-7_13
KNOWLEDGE AND SYSTEMS ENGINEERING (KSE 2013), VOL 2
Keywords
Field
DocType
rough set logic,regular double Stone algebra,Heyting-Brouwer logic,Kripke semantics,natural deduction
Kripke semantics,Algebra,Gödel's completeness theorem,Natural deduction,Computer science,Fuzzy logic,Rough set,Artificial intelligence,Machine learning
Conference
Volume
ISSN
Citations 
245
2194-5357
0
PageRank 
References 
Authors
0.34
4
3
Name
Order
Citations
PageRank
Seiki Akama17127.71
Tetsuya Murai218642.10
Yasuo Kudo39526.41