192 search results - page 2 / 39 » Boolean Matching Using Generalized Reed-Muller Forms |
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...
FPGA
2007
ACM
13 years 11 months ago
2007
ACM
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...
ECAI
2006
Springer
13 years 8 months ago
2006
Springer
Various problems in AI can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a ...
DAC
2009
ACM
14 years 5 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...