相关论文: Equivalence-Checking on Infinite-State Systems: Te…

Many major works in social science employ matching to make causal conclusions, but different matches on the same data may produce different treatment effect estimates, even when they achieve similar balance or minimize the same loss…

Peak estimation bounds extreme values of a function of state along trajectories of a dynamical system. This paper focuses on extending peak estimation to continuous and discrete settings with time-independent and time-dependent uncertainty.…

Generalizations of the density-matrix renormalization group method have long been sought after. In this paper, we assess the accuracy of projected entangled-pair states on infinite lattices by comparing with Quantum Monte Carlo results for…

Two pretrained neural networks are deemed equivalent if they yield similar outputs for the same inputs. Equivalence checking of neural networks is of great importance, due to its utility in replacing learning-enabled components with…

There is no consensus on the state-of-the-art approach to historical text normalization. Many techniques have been proposed, including rule-based methods, distance metrics, character-based statistical machine translation, and neural…

Recent experimental tests of the symmetrization postulate of quantum mechanics are discussed. It is shown that in a strict sense these experiments cannot test the validity of the symmetrization postulate, but in most cases do test the…

We outline the principal results of a recent examination of the quantization of systems with first- and second-class constraints from the point of view of coherent-state phase-space path integration. Two examples serve to illustrate the…

We present the scientific motivation for future space tests of the equivalence principle, and in particular the universality of free fall, at the $10^{-17}$ level or better. Two possible mission scenarios, one based on quantum technologies,…

In recent years, semantic similarity measure has a great interest in Semantic Web and Natural Language Processing (NLP). Several similarity measures have been developed, being given the existence of a structured knowledge representation…

According to recent reports, the last loopholes in testing Bell's inequality are closed. It is argued that the really important task in this field has not been tackled yet and that the leading experiments claiming to close locality and…

As online false information continues to grow, automated fact-checking has gained an increasing amount of attention in recent years. Researchers in the field of Natural Language Processing (NLP) have contributed to the task by building…

We consider the problem of determining the state of a quantum system given one or more readings of the expectation value of an observable. The system is assumed to be a finite dimensional quantum control system for which we can influence…

Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of…

Assessing the validity of user simulators when used for the evaluation of information retrieval systems remains an open question, constraining their effective use and the reliability of simulation-based results. To address this issue, we…

We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo recursive functions, a framework for deductive synthesis,…

In this paper we discuss the fidelity of states in infinite dimensional systems, give an elementary proof of the infinite dimensional version of Uhlmann's theorem, and then, apply it to generalize several properties of the fidelity from…

We introduce a new technique to detect separable states using semidefinite programs. This approach provides a sufficient condition for separability of a state that is based on the existence of a certain local linear map applied to a known…

Reachability analysis, in general, is a fundamental method that supports formally-correct synthesis, robust model predictive control, set-based observers, fault detection, invariant computation, and conformance checking, to name but a few.…

Some recent developments in the theory of quantum spin systems are reviewed.

Quantitative properties of stochastic systems are usually specified in logics that allow one to compare the measure of executions satisfying certain temporal properties with thresholds. The model checking problem for stochastic systems with…