1743 search results - page 141 / 349 » Generalized Modal Satisfiability |
128
click to vote
DAC
2009
ACM
16 years 4 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...
131
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple q...
123
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
113
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past a...
132
Voted
ATVA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...