Preprocessing SAT instances can reduce their size considerably. We combine variable
elimination with subsumption and self-subsuming resolution, and show that these …

The paper explores several ways to improve the speed and capacity of combinational
equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use …

Feature modeling is widely used to systematically model features of variant-rich software
systems and their dependencies. By translating feature models into propositional formulas …

The choice of the variable to flip in the Walksat family procedures is always random in that it
is selected from a randomly chosen unsatisfied clause c. This choice in Novelty or R-Novelty …

The main contribution of this paper is an exact common subexpression elimination algorithm
for the optimum sharing of partial terms in multiple constant multiplications (MCMs). We …

Ensuring network reliability is important for satisfying service-level objectives. However,
diagnosing network anomalies in a timely fashion is difficult due to the complex nature of …

Offers an integrated presentation for path planning and motion control of cooperative mobile
robots using discrete-event system principles Generating feasible paths or routes between a …

The Boolean circuits is well established as a data structure for building propositional
encodings of problems in preparation for satisfiability solving. The standard method for …

SAT solvers are often challenged with very hard problems that remain unsolved after hours
of CPU time. The research community meets the challenge in two ways:(1) by improving the …

In this paper, we propose an automated method for planning a team of mobile robots such
that a Boolean-based mission is accomplished. The task consists of logical requirements …