Related papers: Composition and Inversion of Schema Mappings
Type theories can be formalized using the intrinsically (hard) or the extrinsically (soft) typed style. In large libraries of type theoretical features, often both styles are present, which can lead to code duplication and integration…
One approach to multivariate operator theory involves concepts and techniques from algebraic and complex geometry and is formulated in terms of Hilbert modules. In these notes we provide an introduction to this approach including many…
We investigate the relationship between mapping cones and matrix ordered *-vector spaces (i.e., abstract operator systems). We show that to every mapping cone there is an associated operator system on the space of n-by-n complex matrices,…
The focus of these lecture notes is on abstract models and basic ideas and results that relate to the operational semantics of programming languages largely conceived. The approach is to start with an abstract description of the computation…
In this paper, we further develop the framework of Modular Systems that lays model-theoretic foundations for combining different declarative languages, agents and solvers. We introduce a multi-language logic of modular systems. We define…
The method of monotonization of difference schemes is being considered in the paper. The method was earlier proposed by the author for stationary problems. It is investigated in the paper more profoundly. The idea of the method is to build…
By suitable examples we illustrate an algorithm for composition of inverse problems.
Non-self-adjoint second-order ordinary differential operators on a finite interval with complex weights are studied. Properties of spectral characteristics are established and the inverse problem of recovering operators from their spectral…
Network topology inference is a cornerstone problem in statistical analyses of complex systems. In this context, the fresh look advocated here permeates benefits from convex optimization and graph signal processing, to identify the…
These three topics are an attempt to explicate some curiosities of the inverse problem of representation theory (i.e. having a set of operators to describe the "correct" algebraic object, which is represented by them) on simple examples…
The aim of static analysis is to infer invariants about programs that are precise enough to establish semantic properties, such as the absence of run-time errors. Broadly speaking, there are two major branches of static analysis for…
There are many combinatorial optimization problems whose solutions are best represented by permutations. The classic traveling salesperson seeks an optimal ordering over a set of cities. Scheduling problems often seek optimal orderings of…
We discuss various formalisms to describe string-to-string transformations. Many are based on automata and can be seen as operational descriptions, allowing direct implementations when the input scanner is deterministic. Alternatively, one…
In this paper, we study composition operators on Hilbert space of complex-valued harmonic functions. In particular, we explore isometries, the type of self-map that generate bounded composition operator, and characterize the boundedness of…
In the past three decades, a large number of metaheuristics have been proposed and shown high performance in solving complex optimization problems. While most variation operators in existing metaheuristics are empirically designed, this…
We present a system to translate natural language sentences to formulas in a formal or a knowledge representation language. Our system uses two inverse lambda-calculus operators and using them can take as input the semantic representation…
This note clarifies the concept of syntax and semantics and their relationships. Today, a lot of confusion arises from the fact that the word "semantics" is used in different meanings. We discuss a general approach at defining semantics…
Existing computer algebra packages do not fully support quantum mechanics calculations in Dirac's notation. I present the foundation for building such support: a mathematical system for the symbolic manipulation of expressions used in the…
In this article, we discuss formal invariants of singularly-perturbed linear differential systems in neighborhood of turning points and give algorithms which allow their computation. The algorithms proposed are implemented in the computer…
In this chapter we provide an overview of computational modeling for semantic change using large and semi-large textual corpora. We aim to provide a key for the interpretation of relevant methods and evaluation techniques, and also provide…