Sciweavers

ETS
2010
IEEE
150views Hardware» more  ETS 2010»
13 years 5 months ago
Improving CNF representations in SAT-based ATPG for industrial circuits using BDDs
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
Daniel Tille, Stephan Eggersglüß, Rene ...
AIPS
2008
13 years 7 months ago
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
Blaine Nelson, T. K. Satish Kumar
CPAIOR
2007
Springer
13 years 11 months ago
Eliminating Redundant Clauses in SAT Instances
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...
Olivier Fourdrinoy, Éric Grégoire, B...