Jan Paredaens, Paul de Bra, Marc Gyssens, and Dirk van Gucht. The structure of the relational database model. EATCS monographs on theoretical computer science, vol. 17. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1989, x + 231 pp.

1992 ◽  
Vol 57 (2) ◽  
pp. 759-760
Author(s):  
J. A. Makowsky
Keyword(s):  
New York ◽  
Computer Science ◽  
Relational Database ◽  
Theoretical Computer Science ◽  
Theoretical Computer ◽  
Database Model

Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. Journal of computer and system sciences, vol. 18 (1979), pp. 194–211. - Krister Segerberg. A completeness theorem in the modal logic of programs. Universal algebra and applications. Papers presented at Stefan Banach International Mathematical Center at the semester “Universal algebra and applications” held February 15–June 9, 1978, edited by Tadeuz Traczyk, Banach Center Publications, vol. 9, PWN—Polish Scientific Publishers, Warsaw1982, pp. 31–46. - Rohit Parikh. The completeness of propositional dynamic logic. Mathematical foundations of computer science 1978, Proceedings, 7th symposium, Zakopane, Poland, September 4–8, 1978, edited by J. Winkowski, Lecture notes in computer science, vol. 64, Springer-Verlag, Berlin, Heidelberg, and New York, 1978, pp. 403–415. - Dexter Kozen and Rohit Parikh. An elementary proof of the completeness of PDL. Theoretical computer science, vol. 14(1981), pp. 113–118.

1986 ◽  
Vol 51 (1) ◽  
pp. 225-227 ◽  
Author(s):  
Robert Goldblatt
Keyword(s):  
New York ◽  
Computer Science ◽  
Universal Algebra ◽  
Dynamic Logic ◽  
Completeness Theorem ◽  
Theoretical Computer Science ◽  
Propositional Dynamic Logic ◽  
Theoretical Computer ◽  
Mathematical Foundations ◽  
Scientific Publishers

A Family of Polymodal Systems and its Application to Generalized Possibility Measures and Multi-Rough Sets

2006 ◽  
Vol 10 (5) ◽  
pp. 625-632 ◽  
Author(s):  
Sadaaki Miyamoto ◽  
◽  
Tetsuya Murai ◽  
Yasuo Kudo ◽  
◽  
...  
Keyword(s):  
Information System ◽  
Computer Science ◽  
Relational Database ◽  
Rough Sets ◽  
Theoretical Computer Science ◽  
Theoretical Frameworks ◽  
Theoretical Computer ◽  
The One ◽  
Information Tables ◽  
Polymodal Logic

Polymodal systems generally have large areas of applications to theoretical computer science including the theory of programming, while other applications are not yet fully explored. In this paper we consider a family of polymodal systems with the structure of lattices on the polymodal indices. After investigating theory of the polymodal systems such as the completeness, we study two applications. One is generalized possibility measures in which lattice-valued measures are proposed and relations with the ordinary possibility and necessity measures are uncovered. Second application is consideration of an information system as a table such as the one in the relational database. It is known that rough sets are used to discover regularities from such information tables. Applying polymodal logic concept, we generalize rough sets which are called multi-rough sets here. Our consideration is mainly to establish theoretical frameworks in these two application areas and hence no real examples are shown here.

Sign in / Sign up

Export Citation Format

Share Document