1743 search results - page 82 / 349 » Generalized Modal Satisfiability |
61
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
We consider the problem of reconstructing a discrete-time continuous-amplitude signal corrupted by a known memoryless channel with a general output alphabet. We develop a sequence ...
116
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
107
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
89
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
96
Voted
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...