Abstract We introduce Intel (R) SAT Solver (IntelSAT)-a new open-source CDCL SAT solver,
written from scratch. IntelSAT is optimized for applications which generate many mostly …

Boolean satisfiability (SAT) has been studied for the last twenty years. Advances have been
made allowing SAT solvers to be used in many applications including formal verification of …

Multi-core and highly connected architectures have become ubiquitous, and this has
brought renewed interest in language-based approaches to the exploitation of parallelism …

Abstract Answer Set Programming (ASP) has become, in recent years, the paradigm of
choice for the logic programming community and for a wide variety of application domains …

Abstract General Purpose Graphical Processing Units (GPUs) are affordable multi-core
platforms, providing access to large number of cores, but at the price of a complex …

Abstract Answer Set Programming (ASP) has become the paradigm of choice in the field of
logic programming and non-monotonic reasoning. With the design of new and efficient …

This paper illustrates the design and implementation of a conflict-driven ASP solver that is
capable of exploiting the Single-Instruction Multiple-Thread parallelism offered by General …

Modern SAT solvers use clause learning to derive new clauses from a single conflict. This
approach is easily extended to the analysis of multiple conflicts. However, current algorithms …

Unit propagation and conflict analysis are two essential ingredients of CDCL SAT Solving.
The order in which unit propagation is computed does not matter when no conflict is found …

This paper illustrates the design and implementation of a conflict-driven ASP solver that is
capable of exploiting the Single-Instruction Multiple-Thread parallelism offered by General …