: a proposed framework for using topic maps to manage information in blood donation units.
The Diamond Tool: a way of effective development and utilization of knowledge
This paper presents the Diamond Tool for knowledge management. The main objective of its specification and implementation was to create a universal and easily extendable tool for efficient work with knowledge. One of its extensions is the eTrium technology. The principal idea behind this technology is to represent explicitly the knowledge used by the information system by means of a knowledge agent built on the Diamond Tool – in contrary to current approaches, where knowledge is present implicitly...
The embedding of the formal concept analysis into the L-Fuzzy concept theory.
In this work, we study the relation between the concept lattice of Wille ([5], [6]) and the L-Fuzzy concept lattice ([2]) developed by us. To do it, we have defined an application g that associates to each concept of Wille an L-Fuzzy concept. The main point of this work is to prove that if we are working with a crisp relation between an object set and an attribute set, the concept lattice of Wille is a sublattice of the L-Fuzzy concept lattice. At the end, we show a typical example in the formal...
The Gödel Completeness Theorem for Uncountable Languages
This article is the second in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [15] for uncountably large languages. We follow the proof given in [16]. The present article contains the techniques required to expand a theory such that the expanded theory contains witnesses and is negation faithful. Then the completeness theorem follows immediately.
The star clustering algorithm for static and dynamic information organization.
The theory of function structure models.
The Value of Knowing that You Do Not Know
The value of knowing about data availability and system accessibility is analyzed through theoretical models of Information Economics. When a user places an inquiry for information, it is important for the user to learn whether the system is not accessible or the data is not available, rather than not have any response. In reality, various outcomes can be provided by the system: nothing will be displayed to the user (e.g., a traffic light that does not operate, a browser that keeps browsing, a telephone...
Totally coherent set-valued probability assessments
We introduce the concept of total coherence of a set-valued probability assessment on a family of conditional events. In particular we give sufficient and necessary conditions of total coherence in the case of interval-valued probability assessments. Some relevant cases in which the set-valued probability assessment is represented by the unitary hypercube are also considered.
Towards an extension of the 2-tuple linguistic model to deal with unbalanced linguistic term sets
In the domain of Computing with words (CW), fuzzy linguistic approaches are known to be relevant in many decision-making problems. Indeed, they allow us to model the human reasoning in replacing words, assessments, preferences, choices, wishes... by ad hoc variables, such as fuzzy sets or more sophisticated variables. This paper focuses on a particular model: Herrera and Martínez' 2-tuple linguistic model and their approach to deal with unbalanced linguistic term sets. It is interesting since the...
Transition of Consistency and Satisfiability under Language Extensions
This article is the first in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [17] for uncountably large languages. We follow the proof given in [18]. The present article contains the techniques required to expand formal languages. We prove that consistent or satisfiable theories retain these properties under changes to the language they are formulated in.
Two operations of merging and splitting components in a chain graph
In this paper we study two operations of merging components in a chain graph, which appear to be elementary operations yielding an equivalent graph in the respective sense. At first, we recall basic results on the operation of feasible merging components, which is related to classic LWF (Lauritzen, Wermuth and Frydenberg) Markov equivalence of chain graphs. These results are used to get a graphical characterisation of factorisation equivalence of classic chain graphs. As another example of the use...