Related papers: Abstract String Domain Defined with Word Equations…
We show that the existence of string order in a given quantum state is intimately related to the presence of a local symmetry by proving that both concepts are equivalent within the framework of finitely correlated states. Once this…
This paper describes a methodology for defining an executable abstract interpreter from a formal description of the semantics of a programming language. Our approach is based on Skeletal Semantics and an abstract interpretation of its…
This paper investigates the relationships between closed and mixed string amplitudes at the tree level in string theory. Through the analytic continuation of complex variables, we establish a factorization of closed string amplitudes into…
We develop some basic properties of the open string on the symmetric product which is supposed to describe the open string field theory in discrete lightcone quantization (DLCQ). After preparing the consistency conditions of the twisted…
Characterizing hybrid ASP solving in a generic way is difficult since one needs to abstract from specific theories. Inspired by lazy SMT solving, this is usually addressed by treating theory atoms as opaque. Unlike this, we propose a…
Among the most general structures extending the framework by Dung are the abstract dialectical frameworks (ADFs). They come equipped with various types of semantics, with the most prominent - the labeling-based one - analyzed in the context…
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this paper is a contribution to building a general purpose DR…
We consider two questions in string ``phenomenology.'' First, are there any generic string predictions? Second, are there any general lessons which string theory suggests for thinking about low energy models, particularly in the framework…
As alignment links are not given between English sentences and Abstract Meaning Representation (AMR) graphs in the AMR annotation, automatic alignment becomes indispensable for training an AMR parser. Previous studies formalize it as a…
Strings are extensively used in modern programming languages and constraints over strings of unknown length occur in a wide range of real-world applications such as software analysis and verification, testing, model checking, and web…
The boundary conditions of the bosonic string theory in non-zero $B$-field background are equivalent to the second class constraints of a discretized version of the theory. By projecting the original canonical coordinates onto the…
An optical equation for null strings is derived. The equation is similar to Sachs' optical equations for null geodesic congruences. The string optical equation is given in terms of a single complex scalar function $Z$, which is a…
This paper presents an abstraction-refinement method to synthesize control inputs for a discrete-time piecewise linear system. The controlled system behavior satisfies a finite-word linear-time temporal objective while incurring minimal…
String geometry theory is a candidate of the non-perturbative formulation of string theory. In order to determine the string vacuum, we need to clarify how string backgrounds are described in string geometry theory. In this paper, we show…
Spoken Language Understanding (SLU) is composed of two subtasks: intent detection (ID) and slot filling (SF). There are two lines of research on SLU. One jointly tackles these two subtasks to improve their prediction accuracy, and the other…
Abstract interpretation is a well-established technique for performing static analyses of logic programs. However, choosing the abstract domain, widening, fixpoint, etc. that provides the best precision-cost trade-off remains an open…
Using the reduced formulation on large-N Quantum Field Theories we study strings in space-time dimensions higher that one. We present results on possible string susceptibilities, macroscopic loop operators, 1/N -corrections and other…
This paper presents a new approach of automatic text summarization which combines domain oriented text analysis (DoTA) and rhetorical structure theory (RST) in a grammar form: the attributed rhetorical structure grammar (ARSG), where the…
Abstractive text summarization aims to shorten long text documents into a human readable form that contains the most important facts from the original document. However, the level of actual abstraction as measured by novel phrases that do…
Two groups of naturally arising questions in the mathematical theory of domains for denotational semantics are addressed. Domains are equipped with Scott topology and represent data types. Scott continuous functions represent computable…