ML p(r)ior | A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces

A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces

2016-02-02
An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spaces, mostly from a topological point of view by a combinatorial approach. This work also identifies a subclass of these approximation spaces, called $S_\mathcal{MC}$-approximations. Topological properties of this subclass are investigated and finally, the topologies formed by $S_\mathcal{MC}$-approximations are enumerated up to homeomorphism.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2018-05-27

We study relations between evidence theory and S-approximation spaces. Both theories have their root… show more
PDF

Highlights - Most important sentences from the article

2018-11-21

We consider tolerances $T$ compatible with an equivalence $E$ on $U$, meaning that the relational pr… show more
PDF

Highlights - Most important sentences from the article

2019-05-12
1905.04689 | cs.LO

Theories of rough mereology have originated from diverse semantic considerations from contexts relat… show more
PDF

Highlights - Most important sentences from the article

2017-10-09
1710.03115 | cs.LO

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of … show more
PDF

Highlights - Most important sentences from the article

2019-03-18
1903.07477 | cs.FL

We cast new light on the existing models of 1-way deterministic topological automata by introducing … show more
PDF

Highlights - Most important sentences from the article

2018-09-09
1809.02941 | cs.LO

We discuss some applications of WQOs to several fields were hierarchies and reducibilities are the p… show more
PDF

Highlights - Most important sentences from the article

2017-07-19

Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in co… show more
PDF

Highlights - Most important sentences from the article

2018-01-08
1801.02564 | math.FA

We consider certain finite sets of circle-valued functions defined on intervals of real numbers and … show more
PDF

Highlights - Most important sentences from the article

2017-03-29
1703.10251 | math.LO

In one perspective, the main theme of this research revolves around the inverse problem in the conte… show more
PDF

Highlights - Most important sentences from the article

2016-07-20

ProbNetKAT is a probabilistic extension of NetKAT with a denotational semantics based on Markov kern… show more
PDF

Highlights - Most important sentences from the article

2012-12-28
1212.6519 | cs.AI

The concepts of rough and definite objects are relatively more determinate than those of granules an… show more
PDF

Highlights - Most important sentences from the article

2012-10-17

We investigate finite deterministic automata in sets with non-homogeneous atoms: integers with succe… show more
PDF

Highlights - Most important sentences from the article

2012-09-22
1209.4975 | cs.AI

Rough set is mainly concerned with the approximations of objects through an equivalence relation on … show more
PDF

Highlights - Most important sentences from the article

2013-03-14
1303.3319 | cs.DS

The research of attribute characters in information system which contains core, necessary, unnecessa… show more
PDF

Highlights - Most important sentences from the article

2017-01-28
1701.08301 | cs.AI

The study of mereology (parts and wholes) in the context of formal approaches to vagueness can be ap… show more
PDF

Highlights - Most important sentences from the article

2017-04-18
1704.05477 | math.LO

Lattice-theoretic ideals have been used to define and generate non granular rough approximations ove… show more
PDF

Highlights - Most important sentences from the article