Related papers: From Strong Amalgamability to Modularity of Quanti…
We make two contributions to the study of theory combination in satisfiability modulo theories. The first is a table of examples for the combinations of the most common model-theoretic properties in theory combination, namely stable…
The validation of a theory is commonly based on appealing to clearly distinguishable and describable features in properly reduced experimental data, while the use of ab-initio simulation for interpreting experimental data typically requires…
In this work in progress, we discuss independence and interpolation and related topics for classical, modal, and non-monotonic logics.
Various algebraic multigrid algorithms have been developed for solving problems in scientific and engineering computation over the past decades. They have been shown to be well-suited for solving discretized partial differential equations…
Interest in anti-unification, the dual problem of unification, is on the rise due to applications within the field of software analysis and related areas. For example, anti-unification-based techniques have found uses within clone detection…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
We bring an abstract model theory perspective to interpolation. We ask, what is the role of interpolation in the study of extensions of first order logic, such as infinitary logics, generalized quantifiers and higher order logics? The…
We show that any multi-qudit entanglement witness leads to a non-separability indicator for quantum optical fields, which involves intensity correlations. We get, e.g., necessary and sufficient conditions for intensity or intensity-rate…
Interpolation is an important property of classical and many non classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the propositional version of the…
A modular proof-theoretic framework was recently developed to prove Craig interpolation for normal modal logics based on generalizations of sequent calculi (e.g., nested sequents, hypersequents, and labelled sequents). In this paper, we…
Within the paradigm of metamaterials and metasurfaces, electromagnetic properties of composite materials can be engineered by shaping or modulating their constituents, so-called meta-atoms. Synthesis and analysis of complex-shape meta-atoms…
By double ideal quotient, we mean $(I:(I:J))$ where ideals $I$ and $J$. In our previous work [11], double ideal quotient and its variants are shown to be very useful for checking prime divisor and generating primary component. Combining…
For many physical quantities, theory supplies weak- and strong-coupling expansions of the types $\sum a_n \alpha ^n$ and $ \alpha ^p\sum b_n (\alpha^{-2/q) ^n$, respectively. Either or both of these may have a zero radius of convergence. We…
Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…
We consider statistical procedures for hypothesis testing of real valued functionals of matched pairs with missing values. In order to improve the accuracy of existing methods, we propose a novel multiplication combination procedure.…
Congruence closure procedures are used extensively in automated reasoning and are a core component of most satisfiability modulo theories solvers. However, no known congruence closure algorithms can support any of the expressive logics…
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider…
Strong light-matter interactions facilitate not only emerging applications in quantum and non-linear optics but also modifications of materials properties. In particular the latter possibility has spurred the development of advanced…
In contrast to that a weak value of an observable is usually divided into real and imaginary parts, here we show that separation into modulus and argument is important for modular values. We first show that modular values are expressed by…