Semantics of types for database objects
Theoretical Computer Science
A relational algebra for complex objects based on partial information
MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
Using powerdomains to generalize relational databases
Theoretical Computer Science
Notes on the algebraic approach to dependence in information systems
Fundamenta Informaticae
Algebraic aspects of attribute dependencies in information systems
Fundamenta Informaticae
Rules in incomplete information systems
Information Sciences: an International Journal
Contributions to the theory of rough sets
Fundamenta Informaticae
Rough mereology in information systems with applications to qualitative spatial reasoning
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
An Algebraic Approach to Knowledge Representation
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Are There Essentially Incomplete Knowledge Representation Systems?
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Universal Algebra and Computer Science
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Automatic Information Organization and Retrieval.
Automatic Information Organization and Retrieval.
| Hi-index | 0.00 |
The notion of an information system in Pawlak's sense is extended by introducing a certain ordering on the attribute set, which allows to treat some attributes as parts of others. With every extended information system S associated is the set K(S) of those pieces of information that, in a sense, admit a direct access in S. The algebraic structure of the "information space" K(S) is investigated, and it is shown, in what extent the structure of S can be restored from the structure of its information space. In particular, an intrinsic binary relation on K(S), interpreted as entailment, is isolated, and an axiomatic description of a knowledge revision operation based on it is proposed.