62 search results - page 5 / 13 » A Complete Multi-valued SAT Solver |
AAAI
2006
13 years 10 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...
ICCAD
2001
IEEE
14 years 5 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
CP
2000
Springer
14 years 28 days ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
MJ
2007
13 years 8 months ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
JSAT
2008
13 years 8 months ago
2008
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...