6 search results - page 1 / 2 » HaifaSat: A New Robust SAT Solver |
HVC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. HaifaSat is a new SAT solver that is based on a new decision heuristic called Clause-Move-To-Front (CMTF), a new resolutionbased scoring strategy and many other improveme...
DATE
2002
IEEE
13 years 9 months ago
2002
IEEE
We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time...
AAAI
2006
13 years 6 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
JAIR
2006
13 years 4 months ago
2006
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
DATE
2004
IEEE
13 years 8 months ago
2004
IEEE
We propose a new arithmetic reasoning calculus to speed up a SAT solver based on the Davis Putnam Longman Loveland (DPLL) procedure. It is based on an arithmetic bit level descrip...