In the paper we define a class of languages for representation o knowledge in those application areas when a complete information about a domain is not available. In the languages we introduce modal operators determined by accessibility relations depending on parameters.

This article provides an overview of development of Kripke semantics for logics determined by information systems. The proposals are made to extend the standard Kripke structures to the structures based on information systems. The underlying logics are defined and problems of their axiomatization are discussed. Several open problems connected with the logics are formulated. Logical aspects of incompleteness of information provided by information systems are considered.

A similarity relation is a reflexive and symmetric binary relation between objects. Similarity is relative: it depends on the set of properties of objects used in determining their similarity or dissimilarity. A multi-modal logical language for reasoning about relative similarities is presented. The modalities correspond semantically to the upper and lower approximations of a set of objects by similarity relations corresponding to all subsets of a given set of properties of objects. A complete deduction system for the language is presented.

Hyperboolean algebras are Boolean algebras with operators, constructed as algebras of complexes (or, power structures) of Boolean algebras. They provide an algebraic semantics for a modal logic (called here a {\em hyperboolean modal logic}) with a Kripke semantics accordingly based on frames in which the worlds are elements of Boolean algebras and the relations correspond to the Boolean operations. We introduce the hyperboolean modal logic, give a complete axiomatization of it, and show that it lacks the finite model property. The (...) method of axiomatization hinges upon the fact that a "difference" operator is definable in hyperboolean algebras, and makes use of additional non-Hilbert-style rules. Finally, we discuss a number of open questions and directions for further research. (shrink)

ABSTRACT In this paper we introduce and investigate various classes of multimodal logics based on frames with relative accessibility relations. We discuss their applicability to representation and analysis of incomplete information. We provide axiom systems for these logics and we prove their completeness.

One of the important issues in research on knowledge based computer systems is development of methods for reasoning about knowledge. In the present paper semantics for knowledge operators is introduced. The underlying logic is developed with epistemic operators relative to indiscernibility. Facts about knowledge expressible in the logic are discussed, in particular common knowledge and joint knowledge of n group of agents. Some paradoxes of epistemic logic are shown to be eliminated in the given system. A formal logical analysis of (...) reasoning about knowledge is a subject of investigations both in logic and computer science, and several epistemic systems have been proposed to formalize the operator ‘an agent knows’. In the present paper we propose a formalization based on a semantic treatment of knowledge within the framework of rough set theory. The inspiration for the underlying epistemic logic came from the analysis of knowledge transfer in distributed systems developed in Orlowska and Sanders and from the author’s earlier work on indiscernibility and relative accessibility semantics. (shrink)