liu.se
LiU Electronic Press
English Svenska Norsk
«  Back
Full-text not available in DiVA
Create reference »
Author:
Maluszynski, Jan (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory)
Szalas, Andrzej (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Vitoria, Aida (Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA)) (Linköping University, The Institute of Technology)
Title:
A Four-Valued Logic for Rough Set-Like Approximate Reasoning
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory
Linköping University, The Institute of Technology
Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA)
Publication type:
Chapter in book (Refereed)
Language:
English
In:
Transactions on Rough Sets VI Commemorating the Life and Work of Zdzislaw Pawlak, Part I. DOI: 10.1007/978-3-540-71200-8
Editor:
James F. Peters, Andrzej Skowron, Ivo Düntsch, Jerzy Grzymala-Busse, Ewa Orlowska and Lech Polkowski
Publisher: Springer
Series:
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online); 4374/2007
Volume:
6
Pages:
176-190
Year of publ.:
2007
URI:
urn:nbn:se:liu:diva-40837
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-40837
ISBN:
3-540-71198-8, 978-3-540-71198-8
Local ID:
54289
Subject category:
Computer Science
SVEP category:
Computer science
Abstract(en) :

This paper extends the basic rough set formalism introduced by Pawlak [1] to a rule-based knowledge representation language, called Rough Datalog, where rough sets are represented by predicates and described by finite sets of rules. The rules allow us to express background knowledge involving rough concepts and to reason in such a knowledge base. The semantics of the new language is based on a four-valued logic, where in addition to the usual values True and False, we also have the values Boundary, representing uncertainty, and Unknown corresponding to the lack of information. The semantics of our language is based on a truth ordering different from the one used in the well-known Belnap logic [2, 3] and we show why Belnap logic does not properly reflect natural intuitions related to our approach. The declarative semantics and operational semantics of the language are described. Finally, the paper outlines a query language for reasoning about rough concepts.

Available from:
2009-10-10
Created:
2009-10-10
Last updated:
2012-08-31
Statistics:
78 hits
© 2000-2012 |
DiVA Portal
|
DiVA Contact
|
DiVA Log in
|
LiU University Library
|
SwePub
|
Uppsök