相关论文: Advances in Symmetry Breaking for SAT Modulo Theor…

Dynamical Symmetry Breaking (DSB) is a concept theorists rely on very often in the discussions of strong dynamics, model building, and hierarchy problems. In this talk, I will discuss why this is such a permeating concept among theorists…

String constraint solving, and the underlying theory of word equations, are highly interesting research topics both for practitioners and theoreticians working in the wide area of satisfiability modulo theories. As string constraint solving…

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 propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a general purpose propagator for this family of constraints, and show how…

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…

Sentence encoders play a pivotal role in various NLP tasks; hence, an accurate evaluation of their compositional properties is paramount. However, existing evaluation methods predominantly focus on goal task-specific performance. This…

Satisfiability Modulo Theories (SMT) solvers check the satisfiability of quantifier-free first-order logic formulas. We consider the theory of non-linear real arithmetic where the formulae are logical combinations of polynomial constraints.…

Spontaneous symmetry breaking (SSB) is the cornerstone of our understanding of quantum phases of matter. Recent works have generalized this concept to the domain of mixed states in open quantum systems, where symmetries can be realized in…

Satisfiability Modulo Theory (SMT) solvers have advanced automated reasoning, solving complex formulas across discrete and continuous domains. Recent progress in propositional model counting motivates extending SMT capabilities toward model…

We consider the numerical simulation of the acoustic wave equations arising from seismic applications, for which staggered grid finite difference methods are popular choices due to their simplicity and efficiency. We relax the uniform grid…

The CNF formula satisfiability problem (CNF-SAT) has been reduced to many fundamental problems in P to prove tight lower bounds under the Strong Exponential Time Hypothesis (SETH). Recently, the works of Abboud, Hansen, Vassilevska W. and…

Spontaneous symmetry breaking is a foundational concept in physics. In condensed matter, it characterizes conventional continuous phase transitions but is absent at topological phase transitions such as the Berezinskii-Kosterlitz-Thouless…

Modern software for propositional satisfiability problems gives a powerful automated reasoning toolkit, capable of outputting not only a satisfiable/unsatisfiable signal but also a justification of unsatisfiability in the form of resolution…

Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) are widely used in automated verification, but there is a lack of interactive tools designed for educational purposes in this field. To address this gap, we present…

We propose a fundamental setup for the realization of spontaneous symmetry breaking (SSB) and spontaneous antisymmetry breaking (SASB) in the framework of the nonlinear Schroedinger equation with the self-attractive and repulsive cubic…

The Constraint Satisfaction Problem (CSP) is ubiquitous in various areas of mathematics and computer science. Many of its variations have been studied including the Counting CSP, where the goal is to find the number of solutions to a CSP…

Current implementations of pseudo-Boolean (PB) solvers working on native PB constraints are based on the CDCL architecture which empowers highly efficient modern SAT solvers. In particular, such PB solvers not only implement a…

SMT solvers have been used successfully as reasoning engines for automated verification and other applications based on automated reasoning. Current techniques for dealing with quantified formulas in SMT are generally incomplete, forcing…

Satisfiability problem (SAT) is a cornerstone of computational complexity with broad industrial applications, and it remains challenging to optimize modern SAT solvers in real-world settings due to their intricate architectures. While…

Spontaneous symmetry breaking (SSB) occurs when modes of asymmetric profile appear in a symmetric, double-well potential, due to the nonlinearity of the potential exceeding a critical value. In this study, we examine SSB in a periodic…