0000000000185891
AUTHOR
Janis Cirulis
showing 5 related works from this author
An Algebraic Approach to Knowledge Representation
1999
This paper is an attempt to apply domain-theoretic ideas to a new area, viz. knowledge representation. We present an algebraic model of a belief system. The model consists of an information domain of special kind (belief algebra) and a binary relation on it (entailment). It is shown by examples that several natural belief algebras are, essentially, algebras of flat records. With an eye on this, we characterise those domains and belief algebras that are isomorphic to domains or algebras of records. For illustration, we suggest a system of axioms for revision in such a model and describe an explicit construction of what could be called a maxichoise revision.
Pseudocomplements in sum-ordered partial semirings
2007
We study a particular way of introducing pseudocomplementation in ordered semigroups with zero, and characterise the class of those pseudocomplemented semigroups, termed g-semigroups here, that admit a Glivenko type theorem (the pseudocomplements form a Boolean algebra). Some further results are obtained for g-semirings – those sum-ordered partially additive semirings whose multiplicative part is a g-semigroup. In particular, we introduce the notion of a partial Stone semiring and show that several well-known elementary characteristics of Stone algebras have analogues for such semirings.
Knowledge Representation in Extended Pawlak’s Information Systems: Algebraic Aspects
2002
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.
Are There Essentially Incomplete Knowledge Representation Systems?
2001
A mathematical model of a knowledge representation system (KR-system) is proposed. Its prototype is the concept of an information system in the sense of Z. Pawlak; however, the model is, in fact, a substantial extension of the latter. In our model, attributes may form an arbitrary category, where morphisms represent built-in functional dependencies, and uncertainty of knowledge is treated in terms of category theory via monads. Several notions of simulation are also considered for such KR-systems. In this general setting, the semiphilosophical problem mentioned in the title, still open, is given a precise meaning.
Lattice operations on Rickart *-rings
2014
Various authors have investigated properties of the star order (introduced by M.P. Drazin in 1978) on algebras of matrices and of bounded linear operators on a Hilbert space. Rickart involution rings (*-rings) are a certain algebraic analogue of von Neumann algebras, which cover these particular algebras. In 1983, M.F. Janowitz proved, in particular, that, in a star-ordered Rickart *-ring, every pair of elements bounded from above has a meet and also a join. However, the latter conclusion seems to be based on some wrong assumption. We show that the conclusion is nevertheless correct, and provide equational descriptions of joins and meets for this case. We also present various general proper…