Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pawlak, Z.: Information systems – theoretical foundations. Information Systems 6, 205–218 (1981)
Belnap, N.: A useful four-valued logic. In: Eptein, G., Dunn, J. (eds.) Modern Uses of Many Valued Logic, pp. 8–37. Reidel, Dordrecht (1977)
Belnap, N.: How a computer should think. In: Ryle, G. (ed.) Contemporary Aspects of Philosophy, pp. 30–55. Oriel Press, Stocksfield (1977)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Pawlak, Z.: Rough logic. Bull. Polish Acad. Sci. Tech. 35, 253–258 (1987)
Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)
Słowiński, R., Vanderpooten, D.: Similarity relation as a basis for rough approximations. In: Wang, P. (ed.) Advances in Machine Intelligence & Soft Computing, pp. 17–33. Bookwrights, Raleigh (1997)
Słowiński, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Trans. on Data and Knowledge Engineering 12(2), 331–336 (2000)
Doherty, P., Łukaszewicz, W., Szałas, A.: Tolerance spaces and approximative representational structures. In: Günter, A., Kruse, R., Neumann, B. (eds.) KI 2003. LNCS (LNAI), vol. 2821, pp. 475–489. Springer, Heidelberg (2003)
Doherty, P., Łukaszewicz, W., Szałas, A.: Approximate databases and query techniques for agents with heterogenous perceptual capabilities. In: Proceedings of the 7th Int. Conf. on Information Fusion, FUSION’2004, pp. 175–182 (2004)
Doherty, P., Szałas, A.: On the correspondence between approximations and similarity. In: Tsumoto, S., et al. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 143–152. Springer, Heidelberg (2004)
Doherty, P., et al.: Knowledge Representation Techniques. A Rough Set Approach. Studies in Fuziness and Soft Computing, vol. 202. Springer, Heidelberg (2006)
Andersson, R., et al.: Rosy: A rough knowledge base system. In: Ślęzak, D., et al. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3642, pp. 48–58. Springer, Heidelberg (2005)
Vitória, A.: A framework for reasoning with rough sets. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets IV. LNCS, vol. 3700, pp. 178–276. Springer, Heidelberg (2005)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1996)
Doherty, P., Łukaszewicz, W., Szałas, A.: CAKE: A computer-aided knowledge engineering technique. In: van Harmelen, F. (ed.) Proc. 15th European Conference on Artificial Intelligence, ECAI’2002, pp. 220–224. IOS Press, Amsterdam (2002)
Doherty, P., Magnusson, M., Szałas, A.: Approximate databases: A support tool for approximate reasoning. Journal of Applied Non-Classical Logics, Special issue on Implementation of logics 16, 87–118 (2006)
Pawlak, Z.: A treatise on rough sets. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets IV. LNCS, vol. 3700, pp. 1–17. Springer, Heidelberg (2005)
Vitória, A., Damásio, C., Małuszyński, J.: Query answering for rough knowledge bases. In: Wang, G., et al. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 197–204. Springer, Heidelberg (2003)
Ginsberg, M.: Multi-valued logics. In: Proceedings of AAAI-86, Fifth National Conference on Artificial Intelligence, pp. 243–247. AAAI Press, Menlo Park (1986)
Ginsberg, M.: Multivalued logics: a uniform approach to reasoning in ai. Computational Intelligence 4, 256–316 (1988)
Fitting, M.: Bilattices are nice things. In: Proc. PhiLog Conference on Self-Reference, Copenhagen, The Danish Network for Philosophical Logic and Its Applications (2002)
Deransart, P., Ed-Bali, A., Cervoni, L.: Prolog: The Standard Reference Manual. Springer, Heidelberg (1996)
: XSB system. Available at http://xsb.sourceforge.net/
Niemelä, I., Simons, P.: Smodels - an implementation of stable model and the well-founded semantics for normal logic programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 420–429. Springer, Heidelberg (1997)
Simons, P.: Smodels system. Available at http://www.tcs.hut.fi/Software/smodels/
Nilsson, U., Małuszynski, J.: Logic, Programming and Prolog, 2nd edn. John Wiley & Sons, Chichester (1995), http://www.ida.liu.se/~ulfni/lpp/copyright.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Małuszyński, J., Szałas, A., Vitória, A. (2007). A Four-Valued Logic for Rough Set-Like Approximate Reasoning. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J., Orłowska, E., Polkowski, L. (eds) Transactions on Rough Sets VI. Lecture Notes in Computer Science, vol 4374. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71200-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-71200-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71198-8
Online ISBN: 978-3-540-71200-8
eBook Packages: Computer ScienceComputer Science (R0)