In the last decade a lot of effort has been invested into both theoretical and experimental analysis of sat phase transition. However, a deep theoretical understanding of this phenomenon is still lacking. It is still a very challenging problem to determine a relationship between crossover points for different sat problems. This paper introduces one new class of randomly generated sat problems, ...

While after 10 years use of BDDs various BDD-based algorithms have been developed and BDD-techniques have seen dramatic improvements only recently, SAT based techniques are reconsidered with respect to their usability in Electronic Design Automation and in other applications. The organizers took the opportunity to bring together researchers from different areas in computer science, electrical e...

The use of SAT solvers to handle practical problems has grown dramatically over the last decade. SAT solvers are now mature enough to be used in hardware or software model checkers and to have an impact on our everyday’s life of computer users. Many researchers are working on extensions of the current framework to more general constraints: pseudo-boolean (PB) constraints, satisfiability modulo ...

Despite the success of CDCL SAT solvers solving industrial problems, there are still many open questions to explain such success. In this context, the generation of random SAT instances having computational properties more similar to realworld problems becomes crucial. Such generators are possibly the best tool to analyze families of instances and solvers behaviors on them. In this paper, we pr...

The satisfiability (SAT) problem is a fundamental problem in mathematical logic, inference, automated reasoning, VLSI engineering, and computing theory. In this paper, following CNF and D N F local search methods, we introduce the Universal SAT problem model, UniSAT, which transforms the discrete SAT problem on Boolean space (0, l}"' into an unconstrained global optimization problem on real spa...

Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzl...

In this paper, we propose a bounded model-checking based approach for the verification of declarative Web services composition processes using satisfiability solving (SAT). The need for the bounded model-checking approach stems from the nature of declarative processes as they are defined by only specifying the constraints that mark the boundary of the solution to the composition process. The pr...

In this paper, we introduce an ensemble speaker modeling using a speaker adaptive training (SAT) deep neural network (SAT-DNN). We first train a speaker-independent DNN (SIDNN) acoustic model as a universal speaker model (USM). Based on the USM, a SAT-DNN is used to obtain a set of speaker-dependent models by assuming that all other layers except one speaker-dependent (SD) layer are shared amon...

The statistical mechanics of the random K-satisfiability (K-SAT) problem has been the object of many studies in the last years [1][2][3]. The K-SAT was the first problem to be shown to be Nondeterministic Polynomial (NP) complete [4] and the importance of such a model is that it provides a prototype for all the NP complete problems in complexity theory of computer science as well as in statisti...