相关论文: Super Rough Semantics
Rough Set based Spanning Sets were recently proposed to deal with uncertainties arising in the problem in domain of natural language processing problems. This paper presents a novel span measure using upper approximations. The key…
We examine non-dual relational extensions of rough set approximations and find an extension which satisfies surprisingly many of the usual rough set properties. We then use this definition to give an explanation for an observation made by…
In this paper, we present the concepts of the upper and lower approximations of Anti-rough subgroups, Anti-rough subsemigroups, and homeomorphisms of Anti-Rough anti-semigroups in approximation spaces. Specify the concepts of rough in…
The theory of rough paths arose from a desire to establish continuity properties of ordinary differential equations involving terms of low regularity. While essentially an analytic theory, its main motivation and applications are in…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
The problem of comparing concepts of dependence in general rough sets with those in probability theory had been initiated by the present author in some of her recent papers. This problem relates to the identification of the limitations of…
New notions are introduced in algebra in order to better study the congruences in number theory. For example, the <special semigroups> makes an important such contribution.
Theories of rough mereology have originated from diverse semantic considerations from contexts relating to study of databases, to human reasoning. These ideas of origin, especially in the latter context, are intensely complex. In this…
The concepts of rough and definite objects are relatively more determinate than those of granules and granulation in general rough set theory (RST) [1]. Representation of rough objects can however depend on the dialectical relation between…
We present a system for object recognition based on a semantic graph representation, which the system can learn from image examples. This graph is based on intrinsic properties of objects such as structure and geometry, so it is more robust…
In 1982, the theory of rough sets proposed by Pawlak and in 2013, Luay concerned a rough probability by using the notion of Topology. In this paper, we study the rough probability in the stochastic approximation spaces by using set-valued…
We study multigranulation spaces of two equivalences. The lattice-theoretical properties of so-called "optimistic" and "pessimistic" multigranular approximation systems are given. We also consider the ordered sets of rough sets determined…
Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability, i.e. how "much" it is attacked by other arguments. Many different gradual semantics have been proposed in the literature, each…
Predicting the structure of a discourse is challenging because relations between discourse segments are often implicit and thus hard to distinguish computationally. I extend previous work to classify implicit discourse relations by…
A class of subsets designated as very thin subsets of natural numbers has been studied and seen that theory of convergence may be rediscovered if very thin sets are given to play main role instead of thin or finite sets which removes some…
This paper aims to expand and detail the notion of formal semantics of Conjectures by applying a theoretic-model approach. After a short introduction to the concepts and basics of Conjectures, we will start from the notion of Simple…
We provide a rough sets semantics for the three-valued extension of first-order Priest's da Costa logic, which we studied in [Castiglioni, J.L. and Ertola-Biraben, R.C. Modalities combining two negations. {\em Journal of Logic and…
We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…
In this paper, using the concept of natural density, we have introduced the notion of rough statistical convergence which is an extension of the notion of rough convergence in a partial metric space. We have defined the set of rough…
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…