Related papers: On Deductive Systems of AC Semantics for Rough Set…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
This paper connects a vector-based composition model to a formal semantics, the Dependency-based Compositional Semantics (DCS). We show theoretical evidence that the vector compositions in our model conform to the logic of DCS.…
We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…
Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…
A number of numeric measures like rough inclusion functions (RIFs) are used in general rough sets and soft computing. But these are often intrusive by definition, and amount to making unjustified assumptions about the data. The…
In formal argumentation, a distinction can be made between extension-based semantics, where sets of arguments are either (jointly) accepted or not, and ranking-based semantics, where grades of acceptability are assigned to arguments.…
This is a draft of an article to appear in the October 2022 issue of the Notices of the AMS. In this survey article we explore a fascinating area called descriptive combinatorics and its recently discovered connections to distributed…
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…
Stochastic (Markovian) process algebra extend classical process algebra with probabilistic exponentially distributed time durations denoted by rates (the parameter of the exponential distribution). Defining a semantics for such an algebra,…
Title: From favorable atomic configurations to supershell structures: a new interpretation of conductance histograms Authors: A. Hasmy (IVIC), E. Medina (IVIC), P.A. Serena (CSIC,IVIC) Comments: 7 pages, 3 figures, cond-mat.anwar.10825…
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…
In recent years, a new interest for the use of graph-theory based networks has emerged within the field of cognitive science. This has played a key role in mining the large amount of data generated by word association norms. In the present…
The development of mechanised language specification based on structured operational semantics, with applications to verified compilers and sound program analysis, requires huge effort. General theory and frameworks have been proposed to…
In this paper we prove first a general theorem on semiorthogonal decompositions in derived categories of coherent sheaves for flat families over a smooth base. Based on the results of math.AG/0510670, we then show that the derived…
This article is devoted to the study of classical and new results concerning equidistant sets, both from the topological and metric point of view. We start with a review of the most interesting known facts about these sets in the euclidean…
In this article we explain the theory of rigid residue complexes in commutative algebra and algebraic geometry, summarizing the background, recent results and anticipated future results. Unlike all previous approaches to Grothendiec…
A technique called analytic perturbation theory, which respects the required analytic properties, consistent with causality, is applied to the definition of the running coupling in the timelike region, to the description of inclusive…
The goal of this paper is to generalize some of the existing toolkit of combinatorial algebraic topology in order to study the homology of abstract chain complexes. We define shellability of chain complexes in a similar way as for cell…
We clarified the connection between measurements and partitions, and discussed the meaning of semiotics for measurements based on functions. The terms of property and relation quantity were defined by our understanding of partitions and…
In this paper, we propose SemanticAC, a semantics-assisted framework for Audio Classification to better leverage the semantic information. Unlike conventional audio classification methods that treat class labels as discrete vectors, we…