Abstract — Boolean Satisfiability (SAT) solvers have been the subject of remarkable improvements since the mid 90s. One of the main reasons for these improvements has been the wide range of practical applications of SAT. Indeed, examples of modern applications of SAT range from termination analysis

and graph theory with a first-principles theory of router-level topology that reflects practical constraints and tradeoffs. While there is an inevitable tradeoff between model complexity and fidelity, a challenge is to distill from the seemingly endless list of potentially relevant technological

Abstract. Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on which these procedures have been effective are non-Boolean in that they are most naturally formulated in terms

In this paper, we try to further demonstrate that the models of random CSP instances proposed by [Xu and Li, 2000; 2003] are of theoretical and practical interest. Indeed, these models, called RB and RD, present several nice features. First, it is quite easy to generate random instances of any

Abstract. Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various appli-cation domains. Also motivated by the availability of efficient solvers for propo-sitional satisfiability (SAT), various reductions from logic

large amount of work and preparation can be done in advance as a batch process. In practice, it is likely that the total time for computation will be decreased significantly and laboratory procedures will be simplified. 1. The Satisfiability (SAT) Problem The Boolean Satisfiability (SAT) problem

Boolean satisfiability (SAT) solvers have improved enormously in performance over the last 10–15 years and are today an indispensable tool for solving a wide range of computational problems. However, our understanding of what makes SAT instances hard or easy in practice is still quite limited. A

. INTRODUCTION The satisfiability problem is a well-known NP-hard problem with relevant practical applications (cf., e.g. [3]). Given a boolean formula, one has to find an instantiation of its variables that makes the formula true. Recall that a boolean formula is a conjunction of clauses, where a clause is a

We define a notion of degree of unsolvability for subsets of R ” (where R is a real closed Archimedean field) and prove that, in contrast to Type 2 computability, the presence of exact equality in the BSS model forces exactly one jump of the unsolvability degree of decidable sets. @ 1999 Elsevier Science B.V. All rights reserved. 1.

Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficiency has prevented them from being used in practice. One of the roots of this inefficiency is that non-interactive zero