Computation of Cut Completions and Concept Lattices Using Relational Algebra and RelView
نویسنده
چکیده
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices. It is shown how the algorithms can be translated into the programming language of RelView and executed using this system. Furthermore, it is demonstrated how to obtain and draw Hasse diagrams of concept lattices as labeled directed graphs using the RelView system.
منابع مشابه
Computations on Simple Games Using RelView
Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper we present relational models of simple games and develop relational algorithms for solving some game-theoretic basic problems. The algorithms immediately can be transformed into the language of the Computer Algebra system RelView and, therefore, the system can be used ...
متن کاملRELVIEW - A System for Calculating With Relations and Relational Programming
The calculus of relational algebra has its roots in the second half of the last century with the pioneering work on binary relations of G. Boole, A. de Morgan, C.S. Peirce, and E. Schröder. The modern axiomatic development is due to A. Tarski and his co-workers. In the last two decades this formalization has been accepted by many mathematicians and computer scientists as a fruitful base for des...
متن کاملRelation-algebraic computation of fixed points with applications
We use relational algebra for describing sets and sets of sets and for computing all fixed points of certain functions on powersets. The method is illustrated by some examples from different problem domains, and results of our practical experiments with the RelView system are reported.
متن کاملApplying relational algebra and RelView to coalition formation
We present an application of relational algebra to coalition formation. This leads to specifications, which can be executed with the help of the RelView tool after a simple translation into the tool’s programming language. As an example we consider a simplification of the situation in Poland after the 2001 elections.
متن کاملInvestigating Finite Models of Non-classical Logics with Relation Algebra and RelView
In computer science, scenarios with interacting agents are often developed using modal logic. We show how to interpret modal logic of knowledge in relation algebra. This allows the use of the RelView tool for the purpose of investigating finite models and for visualizing certain properties. Our approach is illustrated with the well-known ‘muddy children’ puzzle using modal logic of knowledge. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004