Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
This paper describes a relationship between satisfiable and unsatisfiable subsets of constraints that is subsequently used as the foundation for MUS extraction algorithms, implemented for Boolean satisfiability constraints.
This work articulates SAT instances that are unusually difficult for their size, including satisfiable instances derived from routing problems, using an efficient implementation to solve the graph automorphism problem and shows that in structured SAT instances difficulty may be associated with large numbers of symmetries.
This paper describes a new algorithm for extracting unsatisfiable subformulas from a given unsatisfiable CNF formula that adapts the "learning process" of a modern SAT solver to identify unsatisfiableSubformulas rather than search for satisfying assignments.
This work proposes a replacement heuristic for variable-ordering, FORCE, which is dramatically faster than MINCE in practice and easy to implement from scratch and tweak.
A novel technique is developed for extracting all MUSes of a CNF formula, tightly integrat ing the authors' implementation with a modern SAT solver and discussing ways in which ideas from both could be combined to improve further.
An algorithm for generating debugging aid information called witnesses, which are concrete thread schedules that can deterministically trigger the data races, is proposed and precisely encodes the sequential consistency semantics using a scalable predictive model to ensure that the reported witness is always feasible.
SATIRE is introduced, a new satisfiability solver that is particularly suited to verification and optimization problems in electronic design automation, and includes two new features to achieve even higher performance: a facility for incrementally solving sets of related problems, and the ability to handle non-CNF constraints.