Reasoning about Knowledge
Published 1 January 1991
Zdzisław Pawlak
Citations310
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
The concept of the rough set has inspired a variety of logical research (cf. Jian-Ming et al. (1991), Konikowska (1987), Nakamura et al. (1988), Orłowska (1983, 1985a,b,c, 1986, 1987a,b, 1988a,b, 1989, 1990), Pawlak (1987), Rasiowa et al. (1985, 1986a,b), Rauszer (1985, 1986), Szczerba (1987a,b), Vakarelov (1981, 1989, 1991a,b,c), Wasilewska (1988a,b,c, 1989a,b,c) and others). Most of the above mentioned logical research has been directed to create deductive logical tools to deal with approximate (deductive) reasoning.
Keywords
Computer Science
Fundamenta InformaticaeA Modal Logic for Similarity Relations in Pawlak Knowledge Representation Systems
93 Citations1991Dimiter Vakarelov
Studia LogicaKripke semantics for knowledge representation logics
78 Citations1990Ewa Orłowska
The proposals are made to extend the standard Kripke structures to the structures based on information systems and the underlying logics are defined and problems of their axiomatization are discussed.
Studia LogicaLogic of nondeterministic information
69 Citations1985Ewa Orłowska
In the paper, a class of languages for representation o knowledge in those application areas when a complete information about a domain is not available are defined and modal operators determined by accessibility relations depending on parameters are introduced.
Automated reasoning seriesSimilarity, Uncertainty and Case-Based Reasoning in Patdex
55 Citations1991Michael M. Richter, Stefan Weß
This paper describes Patdex from a principal point of view and embed its main concepts into a theoretical framework and describes its use of cases for knowledge acquisition.
Theoretical Computer ScienceSemantic analysis of inductive reasoning
49 Citations1986Ewa Orłowska
It is claimed that since concepts are relative to background knowledge, their inductive generalisations can be determined only approximately, and induction rules are defined providing a method of forming generalisations preserving positive and/or negative instances of concepts.
Dependency of attributes in information systems
37 Citations1985Zdzisław Pawlak, Cecylia Rauszer
International Journal of Approximate ReasoningLogical aspects of learning concepts
36 Citations1988Ewa Orłowska
Fundamenta InformaticaeTowards an Approximation Theory of Discrete Problems. Part I
31 Citations1991Andrzej Skowron, Jarosław Stepaniuk
Logical foundations of knowledge representation
24 Citations1984Ewa Orłowska, Zdzisław Pawlak
Information SystemsRepresentation of vague information
15 Citations1988Ewa Orłowska
A semantic approach to concept learning and induction is presented within the framework of the theory of rough sets and a logic is introduced for expressing and proving properties of concepts defined up to indiscernibility relations.
Journal of Applied Non-Classical LogicsRough polyadic modal logics
11 Citations1991Dimiter Vakarelov
Rough polyadic modal logics contain modal operators of many arguments with a relational semantics, based on the Pawlak's rough set theory, and has many applications in different branches in Artificial Intelligence and theoretical computer science.
International Journal of Man-Machine StudiesSyntactic decision procedures in information systems
11 Citations1989Anita Wasilewska
This work deals with a model which is the basis of a rough set investigations and points out problems which can be solved using the automatic syntactic methods within this model.
Fundamenta InformaticaeOn Correctness of Decision Algorithms in Information Systems
2 Citations1988Anita Wasilewska
Fundamenta InformaticaeApplications of Finite Models Properties in Approximation and Algorithmic Logics
2 Citations1991Jarosław Stepaniuk