Related papers: satsuma: Structure-based Symmetry Breaking in SAT
Feature extraction is a fundamental task in the application of machine learning methods to SAT solving. It is used in algorithm selection and configuration for solver portfolios and satisfiability classification. Many approaches have been…
Perhaps the most important aspect of symmetry in physics is the idea that a state does not need to have the same symmetries as the theory that describes it. This phenomenon is known as spontaneous symmetry breaking. In these lecture notes,…
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no known algorithm to solve it in polynomial time. There exists…
We point out a connection between R symmetry and \susy\ breaking. We show that the existence of an R symmetry is a necessary condition for \susy\ breaking and a spontaneously broken R symmetry is a sufficient condition provided two…
Supersymmetry and supergravity extend the standard model by introducing a new symmetry between fermions and bosons. Experimental data imply that supergravity must be broken. Among several mechanisms of supersymmetry breaking, gravity…
The concept of symmetry breaking and the emergence of corresponding local order parameters constitute the pillars of modern day many body physics. The theory of quantum entanglement is currently leading to a paradigm shift in understanding…
In recent years there has been a push to discover the governing equations dynamical systems directly from measurements of the state, often motivated by systems that are too complex to directly model. Although there has been substantial work…
Structured merge tools exploit programming language syntactic structure to enhance merge accuracy by reducing spurious conflicts reported by unstructured tools. By creating and handling full ASTs, structured tools are language-specific and…
We consider the problem of change point detection for high-dimensional distributions in a location family when the dimension can be much larger than the sample size. In change point analysis, the widely used cumulative sum (CUSUM)…
In this article we develop a numerical scheme to deal with interfaces between touching numerical grids when solving the second-order wave equation. We show that it is possible to implement an interface scheme of "penalty" type for the…
Symmetric extensions are essential in quantum mechanics, providing a lens to investigate the correlations of entangled quantum systems and to address challenges like the quantum marginal problem. Though semi-definite programming (SDP) is a…
We propose a new type of symmetry breaking mechanism that takes boundaries into account, and show how it can detect surface modes by interpreting them as the order parameter associated with a generalized symmetry breaking. We argue that…
In the article, within the framework of the Boolean Satisfiability problem (SAT), the problem of estimating the hardness of specific Boolean formulas w.r.t. a specific complete SAT solving algorithm is considered. Based on the well-known…
We discover novel transitions characterized by distinguishability of bosons in non-unitary dynamics with parity-time ($\mathcal{PT}$) symmetry. We show that $\mathcal{PT}$ symmetry breaking, a unique transition in non-Hermitian open…
In this paper, we present ReaS, a technique that combines numerical optimization with SAT solving to synthesize unknowns in a program that involves discrete and floating point computation. ReaS makes the program end-to-end differentiable by…
The Boolean satisfiability (SAT) problem lies at the core of many applications in combinatorial optimization, software verification, cryptography, and machine learning. While state-of-the-art solvers have demonstrated high efficiency in…
Symbolic model checking of parallel programs stands and falls with effective methods of dealing with the explosion of interleavings. We propose a dynamic reduction technique to avoid unnecessary interleavings. By extending Lipton's original…
Over the last two decades, propositional satisfiability (SAT) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. The aim of this paper is to investigate theoretically how Sat can be…
A novel parallel algorithm for solving the classical Decision Boolean Satisfiability problem with clauses in conjunctive normal form is depicted. My approach for solving SAT is without using algebra or other computational search strategies…
We report results of the analysis of the spontaneous symmetry breaking (SSB) in the basic (actually, simplest) model which is capable to produce the SSB phenomenology in the one-dimensional setting. It is based on the Gross-Pitaevskii -…