Wyniki wyszukiwania - Biblioteka Nauki

1

Boundaries, Borders, Fences, Hedges

100%

Polkowski L. , Semeniuk-Polkowska M.

Fundamenta Informaticae

|

2014

|

tom Vol. 129, nr 1/2

149--159

EN

In this essay, we analyze various often semantically identified notions of separating things. In doing this, we contrast the set–theoretical approach based on the notion of an element/point with the mereological approach based on the notion of a part, hence, pointless. We address time aspect of the notion of a boundary and related notions as well as approximate notions defined in the realm of rough (approximate) mereology.

2

Intelligent Information Bypass for More Efficient Emergency Management

88%

Vetulani Z. , Osiński J.

Computational Methods in Science and Technology

|

2017

|

tom Vol. 23, No. 2

105--123

EN

An information bottleneck is one of the typical failure causes in emergency situations. In this paper we focus on a novel approach that consists in applying an intelligent bypass involving natural language processing and AI technologies to minimize the negative effects of the information bottleneck. The system prototype has been implemented for a public security context (anti-hooligan prevention in large scale sport events). It may be adapted to other emergency situations (from anti-terrorist operations to natural disasters). The added value over the standard function of a bypass is the AI-based processing of the information entered to the bypass. As an example of reasoning performed by the bypass we discuss time-and-space information processing implemented in the beta-prototype of the POLINT-112-SMS system. We present the architecture of this system and provide examples of natural language dialogues between human system users and the system (registered at system testing). We discuss a number of possible application areas for the information bypass technology.

3

On the Problem of Boundaries from Mereology and Rough Mereology Points of View

75%

Polkowski L. , Semeniuk-Polkowska M.

Fundamenta Informaticae

|

2014

|

tom Vol. 133, nr 2/3

241--255

EN

The notion of a boundary belongs in the canon of the most important notions of mereotopology, the topological theory induced by mereological structures; the importance of this notion rests not only in its applications to practical spatial reasoning, e.g., in geographical information systems, where it is usually couched under the term of a contour and applied in systems related to economy, welfare, climate, wildlife etc., but also in its impact on reasoning schemes elaborated for reasoning about spatial objects, represented as regions, about spatial locutions etc. The difficulty with this notion lies primarily in the fact that boundaries are things not belonging in mereological universa of things of which they are boundaries. Various authors, from philosophers through mathematicians to logicians and computer scientists proposed schemes for defining and treating boundaries. We propose two approaches to boundaries; the first aims at defining boundaries as things possibly in the universe in question, i.e., composed of existing things, whereas the second defines them as things in a meta–space built over the mereological universe in question, i.e., we assume a priori that boundaries are in a sense ‘things at infinity’, in an agreement with the topological nature of boundaries. Of the two equivalent topological definitions of a boundary, the first, global, defining the boundary as the difference between the closure and the interior of the set, and the second, local, defining it as the set of boundary points whose all neighborhoods transect the set, the first calls for the first type of the boundary and the second is best fitted for the meta–boundary. In the text that follows, we discuss mereology and rough mereology notions (sects. 2, 3), the topological approach to the notion of a boundary and the model ROM with which we illustrate our discussion (sect. 4), the mereology approach (sect. 5), and the approach based on rough mereology and granular computing in the framework of rough mereology (sect. 6).

4

Rough Mereology in information systems with applications to qualitative spatial

63%

Polkowski L. , Skowron A.

|

2000

|

tom Vol. 43, Nr 1-4

291-320

EN

Rough Mereology has been proposed as a paradigm for approximate reasoning in complex information systems. Its primitive notion is that of a predicate of rough inclusion which gives for any two entities of discourse the degree in which one of them is a part of the other. Rough Mereology may be regarded as an extension of Rough Set Theory as it proposes to argue in terms of similarity relations induced from a rough inclusion instead of reasoning in terms of more strict indiscernibility relations. Rough Mereology is also a generalization of Mereology i.e. a theory of reasoning based on the notion of a part. Classical languages of mathematics are of two-fold kind: the language of set theory (naive or formal) expressing classes of objects as sets consisting of ëlements", "points" etc. suitable for objects perceived as built of ätoms" and applied to structures perceived as discrete and the language of part relations suitable for e.g. continuous objects like solids, regions, etc. where two objects are related to each other by saying that one of them is a part of the other. Mereological theories for reasoning about complex structures are at the heart of Qualitative Spatial Reasoning. In this paper, we study basic aspects of Rough Mereology in Information Systems. Mereology makes the distinction between entities perceived as individuals (singletons), to which the part predicate may be applied, and entities perceived as distributive classes (sets, lists, general names etc.) of entities. This distinction is made formal and precise within Ontology i.e. Theory of Being based on the primitive notion of the copula is which is also a basic ingredient of theories for Spatial Reasoning. The practical aim of Ontology is to elaborate a system of concepts (notions, names, sets of entities) about which the reasoning is carried out. Therefore, we begin our study with an analysis of a simple rough set-based Ontology (the template ontology) in Information Systems and in this setting we present our approach to Mereology in Information Systems. In this framework we introduce Rough Mereology and we present some ways for defining rough inclusions. We demonstrate applications of Rough Mereology to approximate reasoning taking as the case subject Qualitative Spatial Reasoning. We address here some of its mereo-topological as well as mereo-geometrical aspects.

5

Mereology and uncertainty

51%

Polkowski L. T.

Logic and Logical Philosophy

|

2015

|

tom 24

|

nr 4 Mereology and Beyond

449-468

EN

Mereology as an art of composing complex concepts out of simpler parts is suited well to the task of reasoning under uncertainty: whereas it is most often difficult to ascertain whether a given thing is an element of a concept, it is possible to decide with belief degree close to certainty that the class of things is an ingredient of an other class, which is sufficient for carrying out the reasoning whose conclusions are taken as true under given conditions. We present in this work a scheme for reasoning based on mereology in which mereology in the classical sense is fuzzified in analogy to the concept fuzzification in the sense of L. A. Zadeh. In this process, mereology becomes rough mereology.