相关论文: Super Rough Semantics

Two types of approximation to the paradoxical Russell Set are presented, one approximating it from below, one from above. It is shown that any lower approximation gives rise to a better approximation containing it, and that any upper…

Current breakthroughs in natural language processing have benefited dramatically from neural language models, through which distributional semantics can leverage neural data representations to facilitate downstream applications. Since…

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Rough sets induced by quasiorders appear in several constructions using binary relations in computer science. In this paper, a structural characterisation of rough sets induced by quasiorders is given. These rough sets form Nelson algebras…

A significant amount of information in today's world is stored in structured and semi-structured knowledge bases. Efficient and simple methods to query them are essential and must not be restricted to only those who have expertise in formal…

We introduce and study semi-equational and weakly semi-equational theories, generalizing equationality in stable theories (in the sense of Srour) to the NIP context. In particular, we establish a connection to distality via one-sided strong…

Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…

The contribution of this paper is to provide a semantic model (using soft constraints) of the words used by web-users to describe objects in a language game; a game in which one user describes a selected object of those composing the scene,…

Rough Set Theory (RST), first introduced by Pawlak in 1982, is an approach for dealing with information systems where knowledge is uncertain or incomplete.\cite{Pawlak} It is of fundamental importance in many subfields of artificial…

In this paper, we present a novel approach to synthesize realistic images based on their semantic layouts. It hypothesizes that for objects with similar appearance, they share similar representation. Our method establishes dependencies…

A semi-projective representation is a homomorphism of a finite group into the group of semi-projective transformations of a finite dimensional vector space over a field. Schur's concept of a representation group for projective…

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…

We examine double successive approximations on a set, which we denote by $L_2L_1, \ U_2U_1, U_2L_1,$ $L_2U_1$ where $L_1, U_1$ and $L_2, U_2$ are based on generally non-equivalent equivalence relations $E_1$ and $E_2$ respectively, on a…

We introduce an asymptotic notion of positivity in algebraic geometry that turns out to be related to some high-dimensional convex sets. The dimension of the convex sets grows with the number of birational operations. In the case of complex…

Structured output prediction problems are ubiquitous in machine learning. The prominent approach leverages neural networks as powerful feature extractors, otherwise assuming the independence of the outputs. These outputs, however, jointly…

Probabilistic programming is becoming increasingly popular thanks to its ability to specify problems with a certain degree of uncertainty. In this work, we focus on term rewriting, a well-known computational formalism. In particular, we…

Here we have introduced the idea of rough convergence of sequences in a cone metric space. Also it has been investigated how far several basic properties of rough convergence as valid in a normed linear space are affected in a cone metric…

Distributional semantics provides multi-dimensional, graded, empirically induced word representations that successfully capture many aspects of meaning in natural languages, as shown in a large body of work in computational linguistics;…

We survey both old and new developments in the theory of algorithms in real algebraic geometry -- starting from effective quantifier elimination in the first order theory of reals due to Tarski and Seidenberg, to more recent algorithms for…