9 search results - page 1 / 2 » A Novel SAT All-Solutions Solver for Efficient Preimage Comp... |
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (...
FMCAD
2004
Springer
15 years 1 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
KR
2010
Springer
14 years 7 months ago
2010
Springer
Measuring the inconsistency degree of a knowledge base can help us to deal with inconsistencies. Several inconsistency measures have been given under different multi-valued semant...
DAC
2001
ACM
15 years 10 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
AISC
2008
Springer
14 years 11 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...