971 search results - page 6 / 195 » Approximate Satisfiability and Equivalence |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
AAAI
2000
13 years 11 months ago
2000
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
JAPLL
2010
13 years 4 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
DATE
2008
IEEE
14 years 4 months ago
2008
IEEE
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Anisotropic decompositions using representation systems such as curvelets, contourlet, or shearlets have recently attracted significantly increased attention due to the fact that...