A Note on the Correspondence among Entail Relations, Rough Set Dependencies, and Logical Consequence.

  title={A Note on the Correspondence among Entail Relations, Rough Set Dependencies, and Logical Consequence.},
  author={Ivo D{\"u}ntsch and G{\"u}nther Gediga},
  journal={Journal of mathematical psychology},
  volume={45 2},
In this note, we report that entail relations defined in the context of knowledge spaces are equivalent to the dependence relations of rough set data analysis and Tarski's consequence relation of monotone logic. We also discuss the connection between these and related structures. Copyright 2001 Academic Press. 

Tables from this paper

Algebraic aspects of attribute dependencies
Dependency properties are investigated and a partial ordering of information systems over a fixed object set U is introduced which reflects the sub–semilattice relation on the set of all equivalence relations on U.
Logical and algebraic techniques for rough set data analysis
This paper gives an introduction to, and an overview of, the various relational, algebraic, and logical tools that are available to handle rule based reasoning.
Rough Set Approximations in Formal Concept Analysis and Knowledge Spaces
A generalized definition of rough set approximations is proposed, based on a subsystem of subsets of a universe, where the lower or upper approximation is no longer one set but composed of several sets.
Granular Structures and Approximations in Rough Sets and Knowledge Spaces
This chapter presents a general framework of granular spaces and examines the granular structures and approximations in rough set analysis and knowledge spaces.
Analyzing skill sets with or-relation tables in knowledge spaces
In this paper, an or-relation skill-question table is considered for a disjunctive model of knowledge spaces and an algorithm for finding the minimal skill set is proposed.
Author ' s personal copy Knowledge spaces with graded knowledge states q , qq
An extension of the theory of knowledge spaces which accounts for gradedness of knowledge states is proposed, assuming that a knowledge state is represented by a fuzzy set with degrees representing levels to which an individual has mastered the items.
Knowledge Spaces with Graded Knowledge States
  • E. Bartl, R. Belohlávek
  • Computer Science
    2008 International Symposium on Knowledge Acquisition and Modeling
  • 2008


Algebraic Aspects of Attribute Dependencies in Information Systems
We exhibit some new connections between structure of an information system and its corresponding semilattice of equivalence relations. In particular, we investigate dependency properties and
Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems
  • D. Gabbay
  • Computer Science
    Logics and Models of Concurrent Systems
  • 1984
Inference mechanism to extract more information out of P, a set of propositions of predicate logic, which is a collection of confirmed data items.
On query procedures to build knowledge structures
It is shown that more general knowledge structures can be generated using modified query procedures and the general theory of the Galois connections between entail relations and knowledge structures is explored.
Incomplete Information: Rough Set Analysis
This book discusses Rough Sets, Rough Set-Based Deduction Methods, and Similarity-Based Reasoning, a Logic for Reasoning about Similarity Information Systems, Similarity Relations and Modal Logics.
Knowledge Spaces and Formal Concept Analysis
The attribute exploration as a method of conceptual knowledge acquisition yields a new approach for building knowledge spaces and can be effectively connected with formal concept analysis.
An Introduction to Lattices and Order
This chapter discusses the structure of finite distributive lattices and finite Boolean algebras, and the role of lattices in algebra in this structure.
How to build a knowledge space by querying an expert
Formal Concept Analysis: Mathematical Foundations
From the Publisher: This is the first textbook on formal concept analysis. It gives a systematic presentation of the mathematical foundations and their relation to applications in computer science,
Dependence Spaces of Information Systems
The main feature of the model is that it enables us to deal with the indiscernibility-type incompleteness of information that a modelled structure might be burdened with.