Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there
are still many challenging problems for SAT solvers. Nowadays, extra computational power …

Small organisms (meiofauna) inhabiting sediments in the deepest (> 10,000 m) ocean
trenches are almost unknown. Through a quantitative study of live foraminifera from an …

The propositional satisfiability (SAT) problem is one of the most fundamental problems in
computer science. SAT solvers have been successfully applied to a wide range of practical …

Local search algorithms for satisfiability testing are still the best methods for a large number
of problems, despite tremendous progresses observed on complete search algorithms over …

In contrast to common automated theorem proving approaches, in which the search space is
a set of some formulae and what is sought is again a (goal) formula, we propose an …

Boolean Satisfiability (SAT) solvers have been successfully applied to a wide range of
practical applications, including hardware model checking, software model finding …

We present a method for proving rigid first order theorems by encoding them as
propositional satisfiability problems. We encode the existence of a first order connection …

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

In this paper a learning based local search approach for propositional satisfiability is
presented. It is based on an original adaptation of the conflict driven clause learning (CDCL) …

With the increasing complexity of chips design, the design errors or defects will inevitably
increase. It is difficult to detect corresponding design logic problems with some conventional …