Related papers: SAT Modulo Monotonic Theories
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…
Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are…
Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\geq 3$) implies efficient solutions to a large number of hard optimization problems…
The Boolean satisfiability problem (SAT) holds a central place in computational complexity theory as the first shown NP-complete problem. Due to this role, SAT is often used as the benchmark for polynomial-time reductions: if a problem can…
A generic lesson of string theory is that the coupling constants of an effective low energy theory are determined by the vacuum values of a set of fields - the so-called moduli - some of which are stabilized at relatively low masses by…
The goal of these lectures is to present an informal but precise introduction to a body of concepts and methods of interest in number theory and string theory revolving around modular forms and their generalizations. Modular invariance lies…
These lectures discuss some of the general issues in developing a phenomenology for Superstring Theory/M Theory. The focus is on the question: how might one obtain robust, generic predictions. For example, does the theory predict low energy…
The famous asynchronous computability theorem (ACT) relates the existence of an asynchronous wait-free shared memory protocol for solving a task with the existence of a simplicial map from a subdivision of the simplicial complex…
This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT), an archetypal NP-complete problem, with the help of machine learning techniques. Despite the great success of modern SAT solvers to solve large…
Let T be an SMT solver with no theory solvers except for Quantifier Instantiation. Given a set of first-order clauses S saturated by Resolution (with a valid literal selection function) we show that T is complete if its Trigger function is…
Linear Software Models is a systematic effort to formulate a theory of software systems neatly based upon standard mathematics, viz. linear algebra. It has appeared in a series of papers dealing with various aspects of the theory. But one…
While syntactic inference restrictions don't play an important role for SAT, they are an essential reasoning technique for more expressive logics, such as first-order logic, or fragments thereof. In particular, they can result in short…
The review presents the development of an approach of constructing approximate solutions to complicated physics problems, starting from asymptotic series, through optimized perturbation theory, to self-similar approximation theory. The…
In the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it…
Real-world machine learning applications may require functions that are fast-to-evaluate and interpretable. In particular, guaranteed monotonicity of the learned function can be critical to user trust. We propose meeting these goals for…
We consider an hierarchy of integrable 1+2-dimensional equations related to Lie algebra of the vector fields on the line. The solutions in quadratures are constructed depending on $n$ arbitrary functions of one argument. The most…
In recent work, several classes of solitonic solutions of string theory with higher-membrane structure have been obtained. These solutions can be classified according to the symmetry possessed by the solitons in the subspace of the…
A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the…
The relationships between port-Hamiltonian systems modeling and the notion of monotonicity are explored. The earlier introduced notion of incrementally port-Hamiltonian systems is extended to maximal cyclically monotone relations, together…
Algorithmic meta-theorems state that problems definable in a fixed logic can be solved efficiently on structures with certain properties. An example is Courcelle's Theorem, which states that all problems expressible in monadic second-order…