295 search results - page 24 / 59 » SAT, SMT and Applications |
108
click to vote
DAM
2007
15 years 1 months ago
2007
The papers in this special issue originated at SAT 2001, the Fourth International Symposium on the Theory and Applications of Satisfiability Testing. This foreword reviews the cu...
DAC
2002
ACM
16 years 2 months ago
2002
ACM
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
140
click to vote
DATE
2004
IEEE
15 years 5 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
120
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
112
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...