Related papers: What Is Decidable about String Constraints with th…
String theory and supersymmetry are theoretical ideas that go beyond the standard model of particle physics and show promise for unifying all forces. After a brief introduction to supersymmetry, we discuss the prospects for its experimental…
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…
To study noncommutativity properties of the open string with constant B-field we construct a mechanical action which reproduces classical dynamics of the string sector under consideration. It allows one to apply the Dirac quantization…
In many real world applications of machine learning, models have to meet certain domain-based requirements that can be expressed as constraints (e.g., safety-critical constraints in autonomous driving systems). Such constraints are often…
A formal series in noncommuting variables $\Sigma$ over the rationals is a mapping $\Sigma^* \to \mathbb Q$. We say that a series is commutative if the value in the output does not depend on the order of the symbols in the input. The…
Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…
String theory has not even come close to a complete formulation after half a century of intense research. On the other hand, a number of features of the theory suggest that the theory, once completed, may be a final theory. It is argued in…
We are motivated by the problem of control for a non-homogeneous elastic string with memory. We reduce the problem of controllability to a non-standard moment problem. The solution of the latter problem is based on an auxiliary Riesz basis…
It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the {\lambda}-calculus definition of polyregular functions from Boja\'nczyk (2018). In this…
An infinite number of distinct $d=1$ matrix models reproduce the perturbation theory of $d=2$ string theory. Due to constraints of causality, however, we argue that none of the existing constructions gives a consistent nonperturbative…
HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, is a uniform framework for expressing information flow policies by relating multiple traces of a security-critical system. HyperLTL has been successfully applied to…
We examine recent claims of a large set of flux compactification solutions of string theory. We conclude that the arguments for AdS solutions are plausible. The analysis of meta-stable dS solutions inevitably leads to situations where long…
We present a straightforward source-to-source transformation that introduces justifications for user-defined constraints into the CHR programming language. Then a scheme of two rules suffices to allow for logical retraction (deletion,…
The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing…
Logically constrained term rewriting is a relatively new rewriting formalism that naturally supports built-in data structures, such as integers and bit vectors. In the analysis of logically constrained term rewrite systems (LCTRSs),…
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by…
Dependency syntax represents the structure of a sentence as a tree composed of dependencies, i.e., directed relations between lexical units. While in its more general form any such tree is allowed, in practice many are not plausible or are…
Literature on Constraint Satisfaction exhibits the definition of several structural properties that can be possessed by CSPs, like (in)consistency, substitutability or interchangeability. Current tools for constraint solving typically…
String theory has been the dominating research field in theoretical physics during the last decades. Despite the considerable time elapse, no new testable predictions have been derived by string theorists and it is understandable that…