相关论文: BreakID: Static Symmetry Breaking for ASP (System …

The solution-space structure of the 3-Satisfiability Problem (3-SAT) is studied as a function of the control parameter alpha (ratio of number of clauses to the number of variables) using numerical simulations. For this purpose, one has to…

The Circuit Satisfiability (CSAT) problem, a variant of the Boolean Satisfiability (SAT) problem, plays a critical role in integrated circuit design and verification. However, existing SAT solvers, optimized for Conjunctive Normal Form…

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…

With the increasing availability of parallel computing power, there is a growing focus on parallelizing algorithms for important automated reasoning problems such as Boolean satisfiability (SAT). Divide-and-Conquer (D&C) is a popular…

We study the $\mathcal{PT} $-symmetry breaking for the scattering problem in a one-dimensional (1D) non-Hermitian tight-binding lattice model with balanced gain and loss distributed on two adjacent sites. In the scattering process the…

We present the new multi-threaded version of the state-of-the-art answer set solver clasp. We detail its component and communication architecture and illustrate how they support the principal functionalities of clasp. Also, we provide some…

Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. In a recent series of papers, we have studied methods to break value symmetries. Our results…

Boolean satisfiability (SAT) has an extensive application domain in computer science, especially in electronic design automation applications. Circuit synthesis, optimization, and verification problems can be solved by transforming original…

In the context of SAT solvers, Shatter is a popular tool for symmetry breaking on CNF formulas. Nevertheless, little has been said about its use in the context of AllSAT problems: problems where we are interested in listing all the models…

Encoding finite linear CSPs as Boolean formulas and solving them by using modern SAT solvers has proven to be highly effective, as exemplified by the award-winning sugar system. We here develop an alternative approach based on ASP. This…

We present a stationary iteration method, namely Alternating Symmetric positive definite and Scaled symmetric positive semidefinite Splitting (ASSS), for solving the system of linear equations obtained by using finite element discretization…

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…

Answer Set Programming (ASP) is an important logic programming paradigm within the field of Knowledge Representation and Reasoning. As a concise, human-readable, declarative language, ASP is an excellent tool for developing trustworthy…

We introduce SAW, a tool for safety analysis of weakly-hard systems, in which traditional hard timing constraints are relaxed to allow bounded deadline misses for improving design flexibility and runtime resiliency. Safety verification is a…

Answer Set Programming (ASP) is a declarative problem solving paradigm that can be used to encode a combinatorial problem as a logic program whose stable models correspond to the solutions of the considered problem. ASP has been widely…

Spontaneous symmetry breaking (SSB) is a property of Hamiltonian equilibrium states which, in the thermodynamic limit, retain a finite average value of an order parameter even after a field coupled to it is adiabatically turned off. In the…

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…

The interest in explainability in artificial intelligence (AI) is growing vastly due to the near ubiquitous state of AI in our lives and the increasing complexity of AI systems. Answer-set Programming (ASP) is used in many areas, among them…

The recent development of bootstrap methods based on semidefinite relaxations of positivity constraints has enabled rigorous two-sided bounds on local observables directly in the thermodynamic limit. However, these bounds inevitably become…

A symmetry of a dynamical system is a map that transforms one trajectory to another trajectory. We introduce a new type of abstraction for hybrid automata based on symmetries. The abstraction combines different modes in a concrete automaton…