Summary
This chapter extends the principles of logic programming forrough relations.The work is based on the formalism ofrough sets[9,16,17], introduced for describing imprecise information. Its objective is to develop techniques that facilitate formal definition of imprecise concepts and reasoning about them.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Reference
K.R. Apt, M. van Emden. Contributions to the theory of logic programming.Journal of the ACM29: 841–862, 1982.
M. Banerjee, M.K. Chakraborty. Algebras from rough sets (this book).
P. Deransart, A. Ed-Bali, L. Cervoni.Prolog: The Standard Reference Manual. Springer, Berlin, 1996.
I. Duentsch I. Rough sets algebras of relations. In E. Orlowska, editorIncomplete Information: Rough Set Analysis95–108, Physica, Heidelberg, 1998.
M.C. Fitting. A Kripke/Kleene semantics for logic programs.Jornal of Logic Programming2: 295–312,1985.
T. Iwiftski. Algebraic approach to rough sets.Bulletin of the Polish Academy of Sciences. Mathematics35: 673–683, 1987.
S.C Kleene.Introduction to Metamathematics. Van Nostrand, Princeton, NJ, 1950.
J. Komorowski, Z. Pawlak, L.Polkowski, A. Skowron. Rough sets: A tutorial. In S. K. Pal, A. Skowron, editorsRough Fuzzy Hybridization: A New Trend in Decision MakingSpringer, Singapore, 1999.
C. Liu, N. Zhong. Dealing with imperfect data by RS-ILP. In S. Hirano, M. Inuiguchi, S. Tsumoto, editorsProceedings of the International Workshop on Rough Set Theory and Granular Computing (RSTGC 2001)Vol. 5(1/2) of the Bulletin of International Rough Set Society2001.
J.W. Lloyd. Foundations of Logic Programming(2nd ed.) Springer, Berlin, 1987.
G. Meuvis.Developing a Prolog System for Rough Set ReasoningMaster’s Thesis, Linköping University, 2001.
U. Nilsson, J. Maluszynski.Logic Programming and Prolog(2nd ed.) Wiley, New York, 1995. Available athttp://www.ida.liu.se/ulfni/lpp/copyright.html.
A. Obtulowicz. Rough sets and Heyting algebra valued sets.Bulletin of the Polish Academy of Sciences. Mathematics35(9/10): 667–671, 1987.
P. Pagliani. Rough set theory and logic-algebraic structures. In E. Orlowska, editorIncomplete Information: Rough Set Analysis109–190, Physica, Heidelberg, 1998.
Z. Pawlak. Rough sets.International Journal of Computer and Information Sciences11(5): 341–356, 1982.
Z. Pawlak.Rough Sets: Theoretical Aspects of Reasoning about DataKluwer, Dordrecht, 1991.
A. Tarski.A lattice-theoretical theorem and its applications.Pacific Journal of Mathematics5: 285–309, 1955.
J.D. Ullman.Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville, MD, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Małuszyński, J., Vitória, A. (2004). Toward Rough Datalog: Embedding Rough Sets in Prolog. In: Pal, S.K., Polkowski, L., Skowron, A. (eds) Rough-Neural Computing. Cognitive Technologies. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18859-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-18859-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62328-8
Online ISBN: 978-3-642-18859-6
eBook Packages: Springer Book Archive