22 search results - page 1 / 5 » An Application of Matroid Theory to the SAT Problem |
COCO
2000
Springer
13 years 10 months ago
2000
Springer
IPCO
2007
13 years 7 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
FMCAD
2008
Springer
13 years 7 months ago
2008
Springer
The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solv...
FROCOS
2007
Springer
13 years 10 months ago
2007
Springer
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
TACAS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...