It has been widely observed that there is no single" dominant" SAT solver; instead, different
solvers perform best on different instances. Rather than following the traditional approach of …

Much effort is spent by programmers everyday in trying to reduce long, failing execution
traces to the cause of the error. We present an algorithm for error cause localization based …

Preprocessing has become a key component of the Boolean satisfiability (SAT) solving
workflow. In practice, preprocessing is situated between the encoding phase and the solving …

It has been widely observed that there is no “dominant” SAT solver; instead, different solvers
perform best on different instances. Rather than following the traditional approach of …

Empirical studies often observe that the performance of algorithms across problem domains
can be quite uncorrelated. When this occurs, it seems practical to investigate the use of …

Many modern-day solvers offer functionality for incremental SAT solving, which preserves
the state of the solver across invocations. This is beneficial when multiple, closely related …

Most or even all competitive DPLL-based SAT solvers have a “restart” policy, by which the
solver is forced to backtrack to decision level 0 according to some criterion. Although not a …

This paper presents a planning simulation system that allows automated planning
practitioners to experiment with planning domains, defined using the PDDL language. The …

We present a hierarchical distributed communication and control architecture for Smart
Grids. The proposed topology consists of multiple layers to allow for robust and flexible data …

Both SAT and# SAT can represent difficult problems in seemingly dissimilar areas such as
planning, verification, and probabilistic inference. Here, we examine an expressive new …